Question

Find the H.C.F of 1651 and 2032 by Euclid divisi on algorithm.

Answer 1

2032 = 1651 × 1 + 381
1651 = 381 × 4 + 127
381 = 127 × 3 + 0

Then the HCF of 1651 and 2032 is 127.

Answer 2

Answer:

HCF of 1651 and 2032 is 127.

Step-by-step explanation:

To find : The H.C.F of 1651 and 2032 by Euclid division algorithm?

Solution :

Euclid division algorithm is $\text{Dividend}=\text{Divisor}\times \text{Quotient}+\text{Remainder}$

The H.C.F of 1651 and 2032 by Euclid division algorithm is given by,

$2032 = 1651\times 1 + 381$

$1651 = 381\times 4 + 127$

$381=127\times 3+0$

Now, The remainder becomes 0.

Therefore, HCF of 1651 and 2032 is 127.