HCF of 28, 63, 70, 72 using Euclid's algorithm

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

Here 63 is greater than 28

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

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

63 = 28 x 2 + 7

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

28 = 7 x 4 + 0

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

Notice that 7 = HCF(28,7) = HCF(63,28) .

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

Here 70 is greater than 7

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

Step 1: Since 70 > 7, we apply the division lemma to 70 and 7, to get

70 = 7 x 10 + 0

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

Notice that 7 = HCF(70,7) .

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

Here 72 is greater than 7

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

Step 1: Since 72 > 7, we apply the division lemma to 72 and 7, to get

72 = 7 x 10 + 2

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

7 = 2 x 3 + 1

Step 3: We consider the new divisor 2 and the new remainder 1, and apply the division lemma to get

2 = 1 x 2 + 0

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

Notice that 1 = HCF(2,1) = HCF(7,2) = HCF(72,7) .

Therefore, HCF of 28,63,70,72 using Euclid's division lemma is 1.