HCF of 401, 95 using Euclid's algorithm

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

Here 401 is greater than 95

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

Step 1: Since 401 > 95, we apply the division lemma to 401 and 95, to get

401 = 95 x 4 + 21

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

95 = 21 x 4 + 11

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

21 = 11 x 1 + 10

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

11 = 10 x 1 + 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 401 and 95 is 1

Notice that 1 = HCF(10,1) = HCF(11,10) = HCF(21,11) = HCF(95,21) = HCF(401,95) .

Therefore, HCF of 401,95 using Euclid's division lemma is 1.