Math, asked by wwwashrafsana6, 1 year ago

Use euclid's division algorithm find HCF of 15844 and 13281

Answers

Answered by nisha2395
15

Answer:

15844=13281×1+2563

13281=2563×5+466

2563=466×5+233

466=233×2+0


ravishankar1011: hiii
Answered by vajakakshil20
2

Answer:

Step-by-step explanation:

By Euclid's Division Lemma,

15844>13281,

15844=13281*1+2563

13281=2563*5+466

2563=466*5+233

466=233*2+0

As the last non zero remainder is 233 so,

HCF=233

Similar questions