Find the l.c.m using eulid s algorithm 867 and 225
Answers
Answered by
0
Answer:
Now, a=867 and b=255
Step-by-step explanation:
by Euclid division algorithm
a=bq+r where O<r<b
867=255×3+102
255=102×2+51
102=51×2+0
so, HCF(867,255)=51
Similar questions