Question

Using Euclid’s division algorithm to find the largest number that divides 1251, 9377 and 15628.

Answer 1

Answer:

Step-by-step explanation:

1251 - 1 = 1250

9377 - 2 = 9375

15628 - 3 = 15625

[ by Euclid's division lemma ]

a = bq + r

9375 = 1250 × 7 + 625

1250 = 625 × 2 + 0

HCF of 9375 & 1250 is 625

Now,

15625 = 625 × 25 + 0

So,

HCF is 625

mark me as brainlist ,thanku

Answer 2

Answer:

Maybe '1'.

Step-by-step explanation:

Given numbers are 1251, 9377 ,15628

1251 = 3 × 417+0

417 = 3 × 139+0

1251 = 3^2 × 139.

9377=1 × 9377.

15628=2×7814+0

7814=2 ×3907+0

15628=2^2×3907.

Therefore highest common divisor is '1'.