Question

using Euclid, s algorithm, find the HCF of 272 and 1032​

Answer 1

Answer:

HCF(1032,272)= 8.

1. Start with the larger integer, that is 1032, Apply the division Lemma to 1032 and 272, we get.
2. 1032 = 272 × 3 + 216.
3. Since , the remainder 216 ≠ 0.
4. We apply the division Lemma to 272 and 216, we get.
5. 272 = 216 × 1 + 56.
6. Remainder 56≠0.
7. 216 = 56 × 3 + 48.

Answer 2

Answer:

The answer of this question is 8