Math, asked by LakshyaNeema, 6 months ago

Use Euclid's division algorithm, to find the largest number, which divides 957 and
1280 leaving remainder 5 in each case.​

Answers

Answered by roshnidamor635
0

Answer:

The largest number which divides the given number 957 and 1280 gives 5 as the remainder is 17.

Similar questions