HCF of 18, 24, 63, 84 using Euclid's algorithm

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

Here 24 is greater than 18

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

Step 1: Since 24 > 18, we apply the division lemma to 24 and 18, to get

24 = 18 x 1 + 6

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

18 = 6 x 3 + 0

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

Notice that 6 = HCF(18,6) = HCF(24,18) .

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

Here 63 is greater than 6

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

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

63 = 6 x 10 + 3

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

6 = 3 x 2 + 0

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

Notice that 3 = HCF(6,3) = HCF(63,6) .

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

Here 84 is greater than 3

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

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

84 = 3 x 28 + 0

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

Notice that 3 = HCF(84,3) .

Therefore, HCF of 18,24,63,84 using Euclid's division lemma is 3.