Question

Using Euclid's diuision, digoritm Erd
longest number divides that divides
12521,
9377 and 156.28 leaving reminderf
12. und
3
​

Answer 1

▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬

$\boxed {\boxed{ { \red{ \bold{ \underline{Solution:- }}}}}}$

We have to find the H.C.F. of (1251−1=1250),(9377−2=9375),(15628−3=15625),

Find H.C.F of 1250 and 9375 :-

9375=1250×7+625

1250=625×2+0

Since, remainder is 0, the H.C.F is 625

Now, H.C.F of (625,15625) is

15625=625×25+0

Hence 625 is the H.C.F of all the three numbers and divides 1251,9377 and 15628 leaving remainders 1,2 and 3, respectively.

▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬