Question

Using Euclid’s algorithm, find the HCF of 272 and 1032.

Answer 1

Since, 1032 > 272

On applying Euclid’s division algorithm, we get

1032 = 272 × 3 + 216

272 = 216 × 1 + 56

216 = 56 × 3 + 48

56 = 48 × 1 + 8

48 = 8 × 6 + 0

Since, remainder comes to be 0.

Hence, the HCF is same as divisor, which is 8.