Using Euclid's division algorithm, find the largest number that divides 1251,9377 and 15628 leaving the remainders 1,2 and 3 respectively
Answers
Answered by
6
Answer:
Step-by-step explanation:
Attachments:
Similar questions
Social Sciences,
6 months ago
Hindi,
1 year ago
Hindi,
1 year ago
English,
1 year ago
History,
1 year ago
Computer Science,
1 year ago