Have an account?
Skip to Content
Build your own quiz
Suggestions for you
9th -
12thgrade
Chapter 3 and 4 Review: Prime Factorization, GCF, LCM, Euclidean Algorithm
12 questions
Show Answers
See Preview
- 1. Multiple Choice
Use the work shown to calculate gcd(675,195)
1
91
13
15
- 2. Multiple Choice
Find the gcd
2
12
18
144
- 3. Multiple Choice
Find the LCM
612
3
918
306
- 4. Multiple Choice
Find the smallest number that when divided by 5, 6, or 7 has remainder of 3.
213
523
35
45
317
- 5. Multiple Choice
If LCM[8,k]=408 and the GCD(8,k)=2, find the value of k.
6
98
102
214
- 6. Multiple Choice
37
13
103
43
- 7. Multiple Choice
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
- 8. Multiple Choice
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
- 9. Multiple Choice
LCM[18,42]
98
126
180
54
- 10. Multiple Choice
How many of the first 100 positive integers are divisible by 13?
7
8
6
10
9
- 11. Multiple Choice
How many positive integers less than 101 are multiples of either 5 or 7 but not both at once?
20
14
3
30
- 12. Multiple Choice
What is the smallest positive four-digit number that gives a quotient 432 with remainder 2 when divided by a positive one-digit number?
1790
866
1298
1294
- Answer choicesTagsAnswer choicesTags