CameraIcon
CameraIcon
SearchIcon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

Use Euclid's division algorithm to find the HCF of:
(i) 135 and 225 (ii) 196 and 38220 (iii) 867 and 255.
Find the highest HCF among them.

Open in App
Solution


(i) By Euclid's division lemma,
225=135×1+90
r=900
135=90×1+45
r=450
90=45×2+0
r=0
So,H.C.F of 135 and 225 is 45

(ii) By Euclid's division lemma,
38220=196×195+0
r=0
So, H.C.F of 38220 and 196 is 196

(iii) By Euclid's division lemma,
867=255×3+102
r=1020
255=102×2+51
r=510
102=51×2+0
r=0
So, H.C.F of 867 and 255 is 51

The highest HCF among the three is 196.

flag
Suggest Corrections
thumbs-up
3
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Euclid's Division Algorithm_Tackle
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon