Question

use Euclid's division algorithm to find hcf of 180670 and 2937

Answer 1

2937 (180670) 61
-17622
______
4450
- 2937
_______
1513
a=bq+r we know that
a=2937×61+1513

and solve same to next step

Answer 2

Answer: Our H.C.F of 180670 and 2937 is 89.

Step-by-step explanation:

We need to find the H.C. F of 180670 and 2937 by using Euclid's division algorithm.

Euclid's division algorithm is the efficient way to find  the highest common factor of both the numbers.

so, it becomes,

$180670=2937\times 61+1513\\\\2937=1513\times 1+1424\\\\1513=1424\times 1+89\\\\1424=89\times 16+0$

So, our H.C.F of 180670 and 2937 is 89.