HCF of 303, 40 using Euclid's algorithm

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

Here 303 is greater than 40

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

Step 1: Since 303 > 40, we apply the division lemma to 303 and 40, to get

303 = 40 x 7 + 23

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

40 = 23 x 1 + 17

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

23 = 17 x 1 + 6

We consider the new divisor 17 and the new remainder 6,and apply the division lemma to get

17 = 6 x 2 + 5

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

6 = 5 x 1 + 1

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

5 = 1 x 5 + 0

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

Notice that 1 = HCF(5,1) = HCF(6,5) = HCF(17,6) = HCF(23,17) = HCF(40,23) = HCF(303,40) .

Therefore, HCF of 303,40 using Euclid's division lemma is 1.