Question

Use Euclid algorithm lemma to find HCF of 1651 and 2032 express the HCF in the form 1651M +2032N

Answer 1

Hey

Here is ur answer

Hope it helps you

Answer 2

Answer:

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