Math, asked by marvelboby123, 3 months ago

use euclid division algorithm to find hcf of 42237 and 75582

Answers

Answered by puthetisudeepthi2002
2

Answer:

2223

Step-by-step explanation:

hcf(m,n)=hcf(m,m mod n).

42237÷75582 gives remainder 33345

33345÷42237 gives remainder 8892

8892 ÷ 33345 gives remainder 6669

6669÷8892 gives remainder 2223

2223÷6669 gives remainder 0

there fore hcf(42237,75582) is 2223

Similar questions