Question

Using Euclid’s division algorithm, find the HCF of 70 and 30.

Answer 1

Now, apply Euclid’s Division lemma on 70 and 30
70 = 30 x 2 + 10.
Since remainder ≠ 0, apply division lemma on divisor 30 and remainder 10

30 = 10 x 3 + 0.
Therefore, H.C.F. of 70 and 30 is 10