Question

Using Euclid's division algorithm, find the largest number that divides 1251,9377 and 15628 leaving the remainder 1,2 and 3 respectively.
plz answer fast

Answer 1

They are basically asking you to find HCF.

So, here you go.

Answer 2

Hey☺☺
Your answer is here ☺

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

1250√9375\7
8750
____
625√1250\2
1250
____
0
____

9375=1250×7+625
1250=625×2+0
HCF=625

625√15625\25
15625
_____
0
_____

15625=625×25+0
HCF=625

hope it helps☺☺☺