Using euclids division algorithm find hcf of 867 and 255
Answers
Answered by
3
Proof:-
Euclid's Division Algorithm:-
=>a=bq+r
→867=255×3+102
→255=102×2+51
→102=51×2+0
[°•° Since, 51 is the divisible factor and highest highest common factor]
=>HCF(867&255)=51
Answered by
13
Attachments:

Similar questions