Question

use euclids algorithm to find HCF 1651 and 2032​

Answer 1

Answer:

hope it helps

please mark me as brainliast

Step-by-step explanation:

2032=(1651×1)+381.

1651=(381×4)+127.

381=(127×3)+0.

Dividend=(Divisor×Quotient)+remainder

Answer 2

Since 2032>1651.

So by applying euclids algorithm,

2032=(1651×1)+381

Again applying euclids algorithm as 381 is not equal to 0.

=>1651=(381×4)+127.

Applying euclids algorithm again as 127 is not equal to 0.

=>381=(127×3)+0

=>127 is the hcf of 1651 and 2032.

Hope it is helpful.