Question

By Euclid’s division lemma, find the HCF of 121 and 209

Answer 1

Answer:

Highest Common Factor of 209,121,349 using Euclid's algorithm

Step 1: Since 209 > 121, we apply the division lemma to 209 and 121, to get

209 = 121 x 1 + 88

Step 2: Since the reminder 121 ≠ 0, we apply division lemma to 88 and 121, to get

121 = 88 x 1 + 33

Step 3: We consider the new divisor 88 and the new remainder 33, and apply the division lemma to get

88 = 33 x 2 + 22

We consider the new divisor 33 and the new remainder 22,and apply the division lemma to get

33 = 22 x 1 + 11

We consider the new divisor 22 and the new remainder 11,and apply the division lemma to get

22 = 11 x 2 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 11, the HCF of 209 and 121 is 11

Notice that 11 = HCF(22,11) = HCF(33,22) = HCF(88,33) = HCF(121,88) = HCF(209,121) .

Step-by-step explanation:

Answer 2

HCF=11

Step-by-step explanation:

the HCF of 121 and 209

Dividend =divisor ×quotient +remainder

(a=bq+r)

121 I smaller than 209

209=121×1+33

121=88×1+33

88=33×2+22

33=22×1+11

22=11×2+0

so,

the HCF of 121 and 209=11