HCF of 700, 71 using Euclid's algorithm

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

Here 700 is greater than 71

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

Step 1: Since 700 > 71, we apply the division lemma to 700 and 71, to get

700 = 71 x 9 + 61

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

71 = 61 x 1 + 10

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

61 = 10 x 6 + 1

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

10 = 1 x 10 + 0

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

Notice that 1 = HCF(10,1) = HCF(61,10) = HCF(71,61) = HCF(700,71) .

Therefore, HCF of 700,71 using Euclid's division lemma is 1.