HCF of 96, 240, 336 using Euclid's algorithm

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

Here 240 is greater than 96

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

Step 1: Since 240 > 96, we apply the division lemma to 240 and 96, to get

240 = 96 x 2 + 48

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

96 = 48 x 2 + 0

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

Notice that 48 = HCF(96,48) = HCF(240,96) .

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

Here 336 is greater than 48

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

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

336 = 48 x 7 + 0

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

Notice that 48 = HCF(336,48) .

Therefore, HCF of 96,240,336 using Euclid's division lemma is 48.