Question

use euclid's algarithem to find the HCF of 1651 and2032​

Answer 1

ANSWER

1651 and 2032,

The given integers are 1651 and 2032,

Since 1651<2032,

Apply Euclid's division algorithm to find HCF of 1651 and 2032

2032=(1651∗1)+381

Since the remainder 381



=0

Apply Euclid's division algorithm to find HCF of 1651 and 381

1651=(381∗4∗1)+127

Since the remainder 127



=0

Apply Euclid's division algorithm to 381 and 127

381=(127∗3)+0

Since the remainder is zero.

∴ HCF of 1651 and 2032 is 127.

(Source:Google, Topper)

Answer 2

Answer:

HCF (1651 , 2032) = 127

Step-by-step explanation:

Let, Bigger number be "a" and Smaller number be "b".

↪ .°. a = 2032 & b = 1651

According to Euclid Divison lemma,

↪ a = bq + r

↪ 2032 = 1651 × 1 + 381

↪ 1651 = 381 × 4 + 127

↪ 381 = 127 × 3 + 0

↪ .°. b = 127 [ °.° a = bq + r ]

Hence,

• The HCF of (1651 & 2032) is 127.