HCF of 143, 35 using Euclid's algorithm

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

Here 143 is greater than 35

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

Step 1: Since 143 > 35, we apply the division lemma to 143 and 35, to get

143 = 35 x 4 + 3

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

35 = 3 x 11 + 2

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

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(35,3) = HCF(143,35) .

Therefore, HCF of 143,35 using Euclid's division lemma is 1.