HCF of 99, 44, 55 using Euclid's algorithm

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

Here 99 is greater than 44

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

Step 1: Since 99 > 44, we apply the division lemma to 99 and 44, to get

99 = 44 x 2 + 11

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

44 = 11 x 4 + 0

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

Notice that 11 = HCF(44,11) = HCF(99,44) .

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

Here 55 is greater than 11

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

Step 1: Since 55 > 11, we apply the division lemma to 55 and 11, to get

55 = 11 x 5 + 0

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

Notice that 11 = HCF(55,11) .

Therefore, HCF of 99,44,55 using Euclid's division lemma is 11.