Question

use euclid's algorithm to find HCF of 1651 2032 Express the HCF in the form of 1651m+ 2032 n​

Answer 1

Answer:

2032 = 1651 × 1 + 381 .

1651 = 381 × 4 + 127  

381 = 127 × 3 + 0.  

Since the remainder becomes 0 here, so HCF of 1651 and 2032 is 127.

∴ HCF (1651, 2032) = 127.

Now,

1651=381×4+127

⇒127=1651−381×4

⇒127=1651−(2032−1651×1)×4 [from 2032 = 1651 × 1 + 381]

⇒127=1651−2032×4+1651×4

⇒127=1651×5+2032×(−4)

Hence, m = 5, n = -4.