Question

find the HCF of 1620 1725 and 255 by using euclid division algorithm

Answer 1

Hey ^_^

Euclid's Division Lemma ----

a = bq+r

Since 1725 is greater than 1620

1725 = 1620 × 1 + 105

1620 = 105 × 15 + 45

105 = 45 × 2 + 15

45 = 15× 3 + 0

Since remainder is 0

H.C.F(1725 , 1620) = 15

Now

255= 15 × 15+ 0

Since remainder is 0

H.CF(1725,1620,25) = 15

✌Hope this helps ✌

Answer 2

Let us find the HCF of 255 and 1620.

Apply Euclids Division Algorithm for 255 and 1620,

1620=255*6+90

Apply Euclids Division Algorithm for 255 and 90,

255 = 90*2 +75

Apply Euclids Division Algorithm for 90 and 75,

90=75*1 +15

Apply Euclids Division Algorithm for 75 and 15,

75 = 15*5+0

So, HCF of 255 and 1620 is 15.

Step-2:

HCF(255,1620,1725)=HCF(15, 1725)

Apply Euclids Division Algorithm for 15 and 1725,

1725=15*115+0

So, HCF(15,1725)=15.