Using Euclid’s division algorithm, find the HCF of

4407, 2938 and 1469

Given numbers are 4407, 2938 and 1469

∴ 4407 > 2938 > 1469

On applying Euclid’s division lemma for 4407 and 2938, we get

4407 = 2938 × 1 + 1469

Here, r = 1469 ≠ 0.

So, again applying Euclid’s division lemma with new dividend 2938 and new divisor 1469, we get

2938 = 1469 × 2 + 0

The remainder has now become 0, so our procedure stops. Since the divisor at this stage is 1469, the HCF of 4407 and 2938 is 1469.

Now, applying Euclid’s division lemma for 1469 and 1469, we get

1469 = 1469 × 1 + 0

Here, remainder = 0

So, HCF of 4407, 2938 and 1469 is 1469.