HCF of 16, 20, 24, 32 using Euclid's algorithm

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

Here 20 is greater than 16

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

Step 1: Since 20 > 16, we apply the division lemma to 20 and 16, to get

20 = 16 x 1 + 4

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

16 = 4 x 4 + 0

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

Notice that 4 = HCF(16,4) = HCF(20,16) .

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

Here 24 is greater than 4

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

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

24 = 4 x 6 + 0

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

Notice that 4 = HCF(24,4) .

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

Here 32 is greater than 4

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

Step 1: Since 32 > 4, we apply the division lemma to 32 and 4, to get

32 = 4 x 8 + 0

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

Notice that 4 = HCF(32,4) .

Therefore, HCF of 16,20,24,32 using Euclid's division lemma is 4.