1970 Canadian MO Problems/Problem 7
Problem
Show that from any five integers, not necessarily distinct, one can always choose three of these integers whose sum is divisible by .
Solution
Let , , and be three integers with equal modularity.
That is, , where or .
In order for the sum of three integers to be divisible by three these three integers should have either all with the same modularity to each other, or they must have distinct modularity.
~Tomas Diaz. orders@tomasdiaz.com
Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.