Euclidean Algorithm

Determine the GCD of 171 and 84 without using prime factor tables.

• 87
• 7
• 6
• 3
• 1

Determine the GCD of 339 and 118 without using prime factor tables.

• 5
• 2
• 1
• 221

Determine the GCD of 224 and 493 without using prime factor tables.

• 2
• 269
• 1
• 5

Find the greatest common divisor (GCD) of 2024 and 744.

• 1280
• 16
• 4
• 8

Find the greatest common divisor (GCD) of 1188 and 2772.

• 198
• 1584
• 792
• 396

Find the greatest common divisor (GCD) of 945 and 1575.

• 630
• 315
• 316
• 1

Find the greatest common divisor (GCD) of 1728 and 1296.

• 432
• 864
• 216

Find the greatest common divisor (GCD) of 1540 and 2310.

• 1540
• 385
• 770

Find the greatest common divisor (GCD) of 1008 and 756.

• 126
• 252
• 504

Find the greatest common divisor (GCD) of 924 and 396.

• 66
• 132
• 528
• 264

Find the greatest common divisor (GCD) of 252 and 198.

• 36
• 18
• 9
• 54

Find the greatest common divisor (GCD) of 792 and 660.

• 132
• 66
• 264
• 12