Question

Using eucids division algorithim find the largest no of divides 1251, 9377 and 15628 learning remainder 1, 2 and 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

Hence, The H.C.F (1250,9375,15625) is 625

You can check it by dividing it with 1,2 and 3 respectively

Thanks!

-TeamBrainly
(BrainlyManager)

Answer 2

HCF of 1250 , 9375 and 15625 is the required number....
So ,
The no. is 125 ...

Hope it is helpful