HCF of 814, 56 using Euclid's algorithm

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

Here 814 is greater than 56

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

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

814 = 56 x 14 + 30

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

56 = 30 x 1 + 26

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

30 = 26 x 1 + 4

We consider the new divisor 26 and the new remainder 4,and apply the division lemma to get

26 = 4 x 6 + 2

We consider the new divisor 4 and the new remainder 2,and apply the division lemma to get

4 = 2 x 2 + 0

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

Notice that 2 = HCF(4,2) = HCF(26,4) = HCF(30,26) = HCF(56,30) = HCF(814,56) .

Therefore, HCF of 814,56 using Euclid's division lemma is 2.