1. Use Euclid's division algorithm to find the HCF of:
(i) 135 and 225
(ii) 196 and 38220
(i) 867 and 255
Answers
Answered by
0
Answer:
16 and 176=16
Step-by-step explanation:
Answered by
0
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=45
90=45×2+0
So, H.C.F of 135 and 225 is 45
(ii) By Euclid's division lemma,
38220=196×195+0r=0
So, H.C.F of 38220 and 196 is 196
(iii) By Euclid's division lemma,
867=255×3+102
r=102
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.
Similar questions