HCF of 14, 49, 63 using Euclid's algorithm

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

Here 49 is greater than 14

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

Step 1: Since 49 > 14, we apply the division lemma to 49 and 14, to get

49 = 14 x 3 + 7

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

14 = 7 x 2 + 0

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

Notice that 7 = HCF(14,7) = HCF(49,14) .

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

Here 63 is greater than 7

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

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

63 = 7 x 9 + 0

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

Notice that 7 = HCF(63,7) .

Therefore, HCF of 14,49,63 using Euclid's division lemma is 7.