Question

Use euclid's division algorithm to find HCF of 250, 175, 425

Answer 1

Answer:

I hope it would help you

Answer 2

Euclid's Division Algorithm:

According to Euclid's Division Lemma if we have two positive integers a and b, then there exists unique integers q and r which satisfies the condition a = bq + r where 0 ≤ r ≤ b. 

HCF of 250, 175, 425 by Euclid's Division algorithm:

As Cleary , 450 > 250 > 175

425 = 250 × 1 + 175

250 = 175 × 1 + 75

175 = 75 × 2 + 25

75 = 25 × 3 + 0

[ Division shown in attachment ]

We need to keep on dividing until we get 0 as the remainder.

Hence, the HCF of 250, 175, 425 is 25.