HCF of 150, 250, 375 using Euclid's algorithm

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

Here 250 is greater than 150

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

Step 1: Since 250 > 150, we apply the division lemma to 250 and 150, to get

250 = 150 x 1 + 100

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

150 = 100 x 1 + 50

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

100 = 50 x 2 + 0

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

Notice that 50 = HCF(100,50) = HCF(150,100) = HCF(250,150) .

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

Here 375 is greater than 50

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

Step 1: Since 375 > 50, we apply the division lemma to 375 and 50, to get

375 = 50 x 7 + 25

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

50 = 25 x 2 + 0

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

Notice that 25 = HCF(50,25) = HCF(375,50) .

Therefore, HCF of 150,250,375 using Euclid's division lemma is 25.