1001 and 385 Euclid's devision algorithm to find HCF of
Answers
Answered by
0
a=bq+r where 0<=r <b
1001÷385
=385×2+231
382÷231
=231×1×154
231÷154
=154×1+77
154÷77
=77×2+0
0 has arrived
Divisor is the HCF
So 77 is the HCF
Hope it helps
Mark it as BRAINLIEST if you are satisfied with the answer
Answered by
0
Answer:
Euclid's division Lemma:
a = bq + r
Therefore ,
HCF of 1001 and 385 is 77
Attachments:
Similar questions