Chapter 3 and 4 Review: Prime Factorization, GCF, LCM, Euclidean Algorithm 9th - 12th Grade Quiz

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

Assessment

•

Andrea Hofius

•

9th - 12th Grade

•

90 plays

•

Medium

Student preview

12 questions

Show answers

1.

Multiple Choice

5 mins

1 pt

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

1

91

13

15

2.

Multiple Choice

5 mins

1 pt

Find the gcd

2

12

18

144

3.

Multiple Choice

5 mins

1 pt

Find the LCM

612

3

918

306

4.

Multiple Choice

5 mins

1 pt

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

213

523

35

45

317

5.

Multiple Choice

5 mins

1 pt

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

6

98

102

214

Explore all questions with a free account

or continue with

Microsoft

Apple

Others

By signing up, you agree to our Terms of Service & Privacy Policy

Already have an account?

Find a similar activity

Create activity tailored to your needs using

12 questions

Euclidean Algorithm

•

8th - 10th Grade

15 questions

Exploring Number Theory Concepts

•

9th Grade

10 questions

GCF, LCM, Prime Factorization

•

6th Grade - University

15 questions

GCF, LCM, Prime Factorization

•

6th Grade - University

15 questions

Prime Factorization GCF and LCM

•

6th Grade - University

10 questions

Prime Factorization, Gcf, Lcm

•

6th Grade - University

10 questions

Advance Maths Chapter 3 @ Indefatigables 25, DBSSS,HSLC 25 DMDMA

•

10th Grade

12 questions

Gcf, Lcm, Prime Factorization

•

9th - 12th Grade