HCF of 84, 98, 10 using Euclid's algorithm

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

Here 98 is greater than 84

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

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

98 = 84 x 1 + 14

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

84 = 14 x 6 + 0

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

Notice that 14 = HCF(84,14) = HCF(98,84) .

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

Here 14 is greater than 10

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

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

14 = 10 x 1 + 4

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

10 = 4 x 2 + 2

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

4 = 2 x 2 + 0

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

Notice that 2 = HCF(4,2) = HCF(10,4) = HCF(14,10) .

Therefore, HCF of 84,98,10 using Euclid's division lemma is 2.