Question

What is the largest number that divides each one of 1152 and 1664 exactly?

Options

• 32

• 64

• 128

• 256

Answer 1

128

Explanation:

Using the Euclidean algorithm:

1664 = 1152 × 1 + 512 

1152 = 512 × 2 + 128 

512 = 128 × 4 + 0 

Since the last nonzero remainder is 128, the greatest common divisor is 128.