Question

Using Euclid’s division algorithm, find the HCF of 612 and 1314.

Answer 1

Given: HCF of 612 and 1314.

1314 = 612 × 2 + 90

612 = 90 × 6 + 72

90 = 72 × 1 + 18

72 = 18 × 4 + 0

The remainder becomes 0, so the last nonzero remainder 18 is the HCF.

HCF(612, 1314) = 18.