HCF of 84, 210, 336 using Euclid's algorithm

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

Here 210 is greater than 84

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

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

210 = 84 x 2 + 42

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

84 = 42 x 2 + 0

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

Notice that 42 = HCF(84,42) = HCF(210,84) .

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

Here 336 is greater than 42

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

Step 1: Since 336 > 42, we apply the division lemma to 336 and 42, to get

336 = 42 x 8 + 0

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

Notice that 42 = HCF(336,42) .

Therefore, HCF of 84,210,336 using Euclid's division lemma is 42.