Prove that a sequence of $11$ numbers always contains six numbers summing up to a multiple of $6$.

111 Views Asked by At

Prove that a sequence of $11$ numbers always contains six numbers summing up to a multiple of $6$.

This is a problem from a selection to IMO 2014.

1

There are 1 best solutions below

0
On BEST ANSWER

This is a special case of the Erdos Ginzburg Ziv theorem (namely with $n=6$).

The theorem in general says that if you take $2n-1$ integers, then some subset of size $n$ must have sum that is a multiple of $n$. You can find several proofs here.