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
Hindi,
3 months ago
Science,
3 months ago
History,
3 months ago
Social Sciences,
7 months ago
Business Studies,
11 months ago
Math,
11 months ago
Biology,
11 months ago