10 integers are given. We know that there is no way of choosing some of them whose sum is divisible by 10. What can be the remainders of the 10 integers when divided by 10?

Printable View

- Dec 25th 2008, 01:09 AMjames_bondCombinatorics and number theory
10 integers are given. We know that there is no way of choosing some of them whose sum is divisible by 10. What can be the remainders of the 10 integers when divided by 10?

- Dec 26th 2008, 01:40 PMawkward
Hi james bond,

No such collection of integers can exist.

Let's say the integers are . Consider the sums for . If any of the sums is divisible by 10 we're done, so let's suppose none of them are. Then the possible remainders of the sums are 1, 2, ..., 9. Since there are 10 sums and 9 possible remainders, at least two of the sums, say and , with , have the same remainder, by the Pigeonhole Principle. Then is divisible by 10. - Dec 27th 2008, 03:39 AMGrandad
- Dec 27th 2008, 06:27 AMawkward