Euclid's division algorithm to find HCF 867 and 255
Answers
Answered by
1
Answer:
a=bq+r
867=255×q+r
867=255×3+102
255=102×2+51
102=51×2+0
HCF=51
Answered by
1
Answer:
make me as brainliest and thank me if the answer is useful
Step-by-step explanation:
(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.
Similar questions