Question

use Euclid division algorithm to find HCF of 250 and 75​

Answer 1

Answer:

Finding HCF of 250, 175 and 425. By using Euclid's division algorithm,. 425 = 250 x 1 + 175. 250 = 175 x 1 + 75. 175 = 75 ...

Step-by-step explanation:

Finding HCF of 250, 175 and 425.

By using Euclid's division algorithm,

425 = 250 x 1 + 175

250 = 175 x 1 + 75

175 = 75 x 2 + 25

75 = 25 x 3 + 0

HCF(250, 175, 425) = 25

Hence, HCF of 250, 175 and 425 is 25

Answer 2

Answer:

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 clearly, 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

Step-by-step explanation:

hope this helps