HCF of 8, 28, 36 using Euclid's algorithm

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

Here 28 is greater than 8

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

Step 1: Since 28 > 8, we apply the division lemma to 28 and 8, to get

28 = 8 x 3 + 4

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

8 = 4 x 2 + 0

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

Notice that 4 = HCF(8,4) = HCF(28,8) .

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

Here 36 is greater than 4

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

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

36 = 4 x 9 + 0

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

Notice that 4 = HCF(36,4) .

Therefore, HCF of 8,28,36 using Euclid's division lemma is 4.