1.

1001 and 385 Euclid's devision algorithm to find HCF of

Answer»

a=bq+R where 0<=r

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



Discussion

No Comment Found

Related InterviewSolutions