Question

Using euclid's division algorithm find the largest no. that divides 1251, 9377, 15628 leaving remainder 1,2,3 respectively

Answer 1

1251 - 1 = 1250
9377 - 2 = 9375
15628 - 3 = 15625

H.C.F of 1250, 9375 and 15625

1250)9375(7
8750
_
625)1250(2
1250
_
0



625)15625(25
15625
_
0

Thus H.C.F (1250,9375,15625) = 625

This is the answer for your question..
You could check this by dividing 1252 , 9377 and 15628 by 625 and see if they leaves reminders 1,2and 3 respectively.
Hope this helps you

Answer 2

Answer:625

Step-by-step explanation:

1251-1=1250

9377-2=9375

15628-3=15625

So, the HCF of 1250,9375 and 15625 will be the answer.

Now, 9375=1250×2+625

1250=625×2+0

Therefore, HCF OF 9375 AND 1250 IS 625.

Now, HCF of 625 and 15625is:

15625=625×25+0

Hence, HCF of 15625 and 625 is 625. Therefore, REQUIRED NUMBER=625