Using Euclid division algorithm,find the largest number that divides 1251,9377and15628 leaving remainders 1,2and3 respectvly
Answers
Answered by
2
Answer:
This is the answer
Hope it helps..
All the best!
Step-by-step explanation:
Attachments:
Answered by
2
I Hope This Will Help You !!!!!!
Attachments:
Similar questions