Given any set of $10$ numbers up to $60$, how many different sums are possible for nonempty subsets of at most $9$ of them (your pigeonholes)? How many nonempty subsets of up to $9$ elements are there (your pigeons)?
First note that any set of five integers includes a subset of three integers whose sum is a multiple of 3. Proof: Consider the five integers modulo 3. There are three possible congruence classes: 0, 1, and 2. If three of the integers fall in a single congruence class, then their sum is a multiple of 3, and we are done. If not, then there is an integer in each of the congruence classes 0, 1, and 2, and their sum is a multiple of three.
Now consider the set of 17 integers. Remove three integers whose sum is a multiple of three, leaving 14 integers. Repeat the process on the set of 14, leaving 11; repeat on the set of 11, leaving 8; repeat on the set of 8, leaving 5; and repeat on the set of 5, leaving 2. Finally we have five sets of three integers each, and the sum of the integers in each set is a multiple of 3. Consider the sums modulo 9. Modulo 9, each sum must fall in one of three congruence classes: 0, 3, or 6. If three of the sums fall in the same congruence class, their sum is a multiple of 9. If not, there must be a sum in each of the congruence classes 0, 3, and 6, and their sum is a multiple of 9. So in either case, we have nine integers whose sum is a multiple of 9.
Best Answer
One way to approach this is as follows: Let $q \in \Bbb N$ be given. Note that for every $q$, there exists some $x \in \Bbb N$ and some $v \in \{0,1,2\}$ such that $q = 3x + v$.
Now let $x_i \in \Bbb N, v_i \in \{0,1,2\}$ be given such that $q_i = 3x_i + v_i$ for all $(1 \leq i \leq 5)$ What we're trying to prove is that for every possible realization of this set of five variables we can find at least one combination of $v_a + v_b + v_c = v_6$ such that $a,b,c$ are all distinct and in $\{1,2,3,4,5\}$ and that $v_6$ is divisible by three.
Assume that there exist a combination of three $v_i (1 \leq i \leq 5)$ such that all three $v_i$ are equal. Without loss of generality we can assume these are $v_1,v_2,v_3$. Then we have that $q_1 + q_2 + q_3 = 3(x_1 + x_2 + x_3) + 3v_1 = 3(x_1+x_2+x_3 + v_1)$ Where me make use of the assumption that $v_1=v_2=v_3$. Clearly the sum $q_q + q_2 + q_3$ is devisible by three.
Now assume there exists no combination of three $v_i(1 \leq i \leq 5)$ such that all three are equal. It is trivial to show that now we have at least one $v_i$ for every possible realisation of $v_i$. Thus, without loss of generallity we can assume $v_1 =0, v_2=1, v_3=2$. We now obtain: $q_1 + q_2 + q_3 = 3(x_1 + x_2 + x_3) + v_1 + v_2 + v_3 = 3(x_1 + x_2 + x_3) + 3 = 3(x_1 + x_2 + x_3 + 1)$.
Which is clearly devisible by three. This completes the proof.
Note that this proof is only applicable for natural numbers. But the extention to integers shouldn't cause too much trouble.