Use Euclid's division algorithm, to find the largest number, which divides 957 and
1280 leaving remainder 5 in each case.
Answers
Answered by
0
Answer:
The largest number which divides the given number 957 and 1280 gives 5 as the remainder is 17.
Similar questions
Math,
2 months ago
Science,
2 months ago
Computer Science,
2 months ago
Social Sciences,
6 months ago
Business Studies,
10 months ago
Math,
10 months ago
Biology,
10 months ago