Question

Use Euclid's algorithm to find the HCF of 1029 and 240.​

Answer 1

A can be represented in the form of a = bq + r

So,

Numbers are 1029 and 240,

1029 = 240 × 4 + 69

240 = 69 × 3 + 33

69 = 33 × 2 + 3

33 = 3 × 11 + 0

So divisor is 3 therefore, By euclid division lemma , 3 is the H.C.F.

Answer 2

Answer: HCF=3

Step-by-step explanation:

Euclid Division Algorithm:-

a=bq+r

1029=240×4+69

240=69×3+33

69=33×2+3

33=3×11+0

Therefore HCF of 1029 and 240 = 3