Understanding the Euclidean Algorithm

What is the greatest common divisor (GCD) of 10 and 45?

• 2

• 15

• 10

• 5

In the Euclidean Algorithm, what do you do after finding the remainder?

• Add the remainder to the larger number

• Replace the larger number with the smaller number and the smaller number with the remainder

• Multiply the remainder by the smaller number

• Subtract the remainder from the smaller number

What is the next step after setting 45 equal to 10 times 4 plus 5 in the Euclidean Algorithm?

• Add 5 to 10

• Multiply 5 by 4

• Replace 45 with 10 and 10 with 5

• Divide 10 by 5

When applying the Euclidean Algorithm to 3,768 and 1,701, what is the first remainder obtained?

• 237

• 366

• 108

• 129

What is the greatest common divisor (GCD) of 3,768 and 1,701?

• 3

• 1

• 2

• 4