HCF of 50, 220, 242 using Euclid's algorithm

Below detailed show work will make you learn how to find HCF of 50,220,242 using the Euclidean division algorithm. So, follow the step by step explanation & check the answer for HCF(50,220,242).

Here 220 is greater than 50

Now, consider the largest number as 'a' from the given number ie., 220 and 50 satisfy Euclid's division lemma statement a = bq + r where 0 ≤ r < b

Step 1: Since 220 > 50, we apply the division lemma to 220 and 50, to get

220 = 50 x 4 + 20

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

50 = 20 x 2 + 10

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

20 = 10 x 2 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 10, the HCF of 50 and 220 is 10

Notice that 10 = HCF(20,10) = HCF(50,20) = HCF(220,50) .

We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma

Here 242 is greater than 10

Now, consider the largest number as 'a' from the given number ie., 242 and 10 satisfy Euclid's division lemma statement a = bq + r where 0 ≤ r < b

Step 1: Since 242 > 10, we apply the division lemma to 242 and 10, to get

242 = 10 x 24 + 2

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

10 = 2 x 5 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 10 and 242 is 2

Notice that 2 = HCF(10,2) = HCF(242,10) .

Therefore, HCF of 50,220,242 using Euclid's division lemma is 2.