Math, asked by mehtapari1983, 7 months ago

Using Euclid's division algorithm, find the largest
number that divides 1251, 9377 and 15628
leaving remainders 1, 2 and 3 respectively.
[Hint: Find HCF of 1250, 9375 and 15625.)


,maths std 10
pls its urgent ​

Answers

Answered by veekvjy
1

Answer:

Heyy your question is answered in the attached pic.

Hope this helps

Attachments:
Similar questions