Chapter 3 and 4 Review: Prime Factorization, GCF, LCM, Euclidean Algorithm

Use the work shown to calculate gcd(675,195)

• 1

• 91

• 13

• 15

Find the gcd

• 2

• 12

• 18

• 144

Find the LCM

• 612

• 3

• 918

• 306

Find the smallest number that when divided by 5, 6, or 7 has remainder of 3.

• 213

• 523

• 35

• 45

• 317

If LCM[8,k]=408 and the GCD(8,k)=2, find the value of k.

• 6

• 98

• 102

• 214

• 37

• 13

• 103

• 43

The prime factorization of 11,220 is 5 x A x B x C x 3 x 11. What is the sum of A + B + C

• 23

• 21

• 15

• 31

The GCF of F and G is 6. The LCM of F and G is 72. F = 18. What is the value of G ?

• 24

• 48

• 36

• 42

LCM[18,42]

• 98

• 126

• 180

• 54

How many of the first 100 positive integers are divisible by 13?

• 7

• 8

• 6

• 10

• 9