wiz-icon
MyQuestionIcon
MyQuestionIcon
2
You visited us 2 times! Enjoying our articles? Unlock Full Access!
Question

Use Euclid's division algorithm to find the HCF of:
867 and 255

Open in App
Solution

867 > 255, we always divide the greater number by smaller one.
Divide 867 by 255, then we get quotient 3 and remainder is 102 so we can write it as:
867 = 255 × 3 + 102
Divide 255 by 102 then we get quotient 2 and remainder is 51 so we can write it as:
255 = 102 × 2 + 51
Divide 102 by 51 we get quotient 2 and no remainder so we can write it as:
102 = 51 × 2 + 0
As there is no remainder, the divisor 51 is our HCF.

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