Question

Use euclid's algorithm to find hcf of 1651 and 2032. Express hcf in the form of 1651m and 2032n

Answer 1

Step-by-step explanation:

HCF of 1651 and 2032 is 127.

127 = 1651M + 2032N

Step-by-step explanation:

We know, Euclid algorithm lemma, a = bq + r where 0 ≤ r < b

From Euclid algorithm lemma,

2032 = 1651 × 1 + 381

1651 = 381 × 4 + 127

381 = 127 × 3 + 0

Hence, HCF = 127

Now, 127 = 1651M + 2032N