Question

1. Use Euclid's divison algorithm to find the HCF of: (i) 135 and 225 (B) 196 and 38220​

Answer 1

Answer:

135 and 225

Step-by-step explanation:

Since the remainder is zero and the divisor is 45, therefore, the HCF of 135 and 225 is 45. Since the remainder is zero and the divisor in this step is 195, therefore, the HCF of 38220 and 196 is 196.

Answer 2

Answer:

make me as brainliest and thank me if the answer is useful

Step-by-step explanation:

By Euclid's division lemma,

225=135×1+90

r=90

135=90×1+45

r=4

90=45×2+0

So,  H.C.F of 135 and 225 is 45

(ii) By Euclid's division lemma,

38220=196×195+0

r = 196

So, H.C.F of 38220 and 196 is 196

(iii) By Euclid's division lemma,

867=255×3+102

r=10

255=102×2+51

r=51

102=51×2+0

So, H.C.F of 867 and 255 is 51

The highest HCF among the three is 196.