HCF of 56, 84, 112 using Euclid's algorithm

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

Here 84 is greater than 56

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

Step 1: Since 84 > 56, we apply the division lemma to 84 and 56, to get

84 = 56 x 1 + 28

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

56 = 28 x 2 + 0

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

Notice that 28 = HCF(56,28) = HCF(84,56) .

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

Here 112 is greater than 28

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

Step 1: Since 112 > 28, we apply the division lemma to 112 and 28, to get

112 = 28 x 4 + 0

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

Notice that 28 = HCF(112,28) .

Therefore, HCF of 56,84,112 using Euclid's division lemma is 28.