HCF of 98, 168, 182 using Euclid's algorithm

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

Here 168 is greater than 98

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

Step 1: Since 168 > 98, we apply the division lemma to 168 and 98, to get

168 = 98 x 1 + 70

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

98 = 70 x 1 + 28

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

70 = 28 x 2 + 14

We consider the new divisor 28 and the new remainder 14, and apply the division lemma to get

28 = 14 x 2 + 0

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

Notice that 14 = HCF(28,14) = HCF(70,28) = HCF(98,70) = HCF(168,98) .

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

Here 182 is greater than 14

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

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

182 = 14 x 13 + 0

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

Notice that 14 = HCF(182,14) .

Therefore, HCF of 98,168,182 using Euclid's division lemma is 14.