HCF of 470, 77 using Euclid's algorithm

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

Here 470 is greater than 77

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

Step 1: Since 470 > 77, we apply the division lemma to 470 and 77, to get

470 = 77 x 6 + 8

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

77 = 8 x 9 + 5

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

8 = 5 x 1 + 3

We consider the new divisor 5 and the new remainder 3,and apply the division lemma to get

5 = 3 x 1 + 2

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

3 = 2 x 1 + 1

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

2 = 1 x 2 + 0

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

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(5,3) = HCF(8,5) = HCF(77,8) = HCF(470,77) .

Therefore, HCF of 470,77 using Euclid's division lemma is 1.