HCF of 70, 77, 863 using Euclid's algorithm

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

Here 77 is greater than 70

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

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

77 = 70 x 1 + 7

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

70 = 7 x 10 + 0

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

Notice that 7 = HCF(70,7) = HCF(77,70) .

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

Here 863 is greater than 7

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

Step 1: Since 863 > 7, we apply the division lemma to 863 and 7, to get

863 = 7 x 123 + 2

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

7 = 2 x 3 + 1

Step 3: 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 7 and 863 is 1

Notice that 1 = HCF(2,1) = HCF(7,2) = HCF(863,7) .

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