HCF of 76, 80, 88, 125 using Euclid's algorithm

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

Here 80 is greater than 76

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

Step 1: Since 80 > 76, we apply the division lemma to 80 and 76, to get

80 = 76 x 1 + 4

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

76 = 4 x 19 + 0

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

Notice that 4 = HCF(76,4) = HCF(80,76) .

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

Here 88 is greater than 4

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

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

88 = 4 x 22 + 0

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

Notice that 4 = HCF(88,4) .

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

Here 125 is greater than 4

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

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

125 = 4 x 31 + 1

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

4 = 1 x 4 + 0

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

Notice that 1 = HCF(4,1) = HCF(125,4) .

Therefore, HCF of 76,80,88,125 using Euclid's division lemma is 1.