Question

using euclid division lemma ,find the largest number that divides 1251,9377 and 15628 leaving remainder 1,2 and 3 respectively​.
please explain

Answer 1

Answer:

Step-by-step explanation:

Nos. are

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

Hope it helps!

Please mark brainliest