Question

use Euclid algorithm to find HCF of 1651 and 2032 express the HCF in form of 1651m + 2032n​

Answer 1

Answer:

HCF is 127.

Step-by-step explanation:

2032=1651*1+381

1651=381*4+127

381=127*3+0

Now,

127=1651m+2032n

127=(127*13)m+(127*16)n

1=13m+16n

Here many solutions possible because we have one equation contains two variable .

If I assume m = 5 and n = -4

Then, 13 × 5 + 16 × -4 = 65 - 64 = 1

So, HCF of 1651 and 2032 in the form of 1651m + 2032n is [1651(5) + 2032(-4)]

Hope it helps uhhh!!