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 $3$ .

Solution

Claim 1: if $a$ , $b$ , and $c$ have equal modularity, then $(a+b+c)$ is divisible by $3$

Proof of Claim 1: Let $a$ , $b$ , and $c$ be three integers with equal modularity.

That is, $a \equiv b\;(mod\;3)\equiv c\;(mod\;3)\equiv k\;(mod\;3)$ , where $k=-1,0,$ or $1$ .

Then $(a+b+c)\equiv 3k\;(mod\;3)\equiv 0\;(mod\;3)$

Thus, if $a$ , $b$ , and $c$ have equal modularity, then $(a+b+c)$ is divisible by $3$

Claim 2: if $a$ , $b$ , and $c$ have different modularity from each other, then $(a+b+c)$ is divisible by $3$

Proof of Claim 2: Let $a$ , $b$ , and $c$ be three integers where one of them is is divisible by 3, the other one has a reminder of 1 when divided by 3 and the other one a reminder of 2, (or -1) for simplicity.

Then $(a+b+c)\equiv (-1+0+1)\;(mod\;3)\equiv 0\;(mod\;3)$

Thus, if $a$ , $b$ , and $c$ have different modularity from each other, then $(a+b+c)$ is divisible by $3$

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.

To have 4 integers that their sum is not divisible by three, then we can't have any combinations of 3 out of 4 where each of those are either the same modularity or different modularity with each other.

Therefore, one can chose 2 integers with the same modularity with each other and another integer with a different modularity but the same modularity with each other.

So, from integers $a$ , $b$ , $c$ , and $d$ , the only combinations of the modularities that we can have with 4 numbers such that no three of those numbers get a sum that divisible by three are:

Combination 1: $0,\;0,\;1,\;1$ , Combination 2: $0,\;0,\;-1,\;-1$ , or Combination 3: $-1,\;-1,\;1,\;1$

The fifth number $e$ will be of modularity $-1, 0,$ or $1$ .

Case 1: $e\equiv -1\;(mod\;3)$

From Combination 1, we have $0,\;0,\;1,\;1,\;-1$ from which we can chose $0,\;1,\;-1$ which is divisible by three

From Combination 2, we have $0,\;0,\;-1,\;-1,\;-1$ from which we can chose $-1,\;-1,\;-1$ which is divisible by three

From Combination 3, we have $-1,\;-1,\;1,\;1,\;-1$ from which we can chose $-1,\;-1,\;-1$ which is divisible by three

Case 2: $e\equiv 0\;(mod\;3)$

From Combination 1, we have $0,\;0,\;1,\;1,\;0$ from which we can chose $0,\;0,\;0$ which is divisible by three

From Combination 2, we have $0,\;0,\;-1,\;-1,\;0$ from which we can chose $0,\;0,\;0$ which is divisible by three

From Combination 3, we have $-1,\;-1,\;1,\;1,\;0$ from which we can chose $-1,\;0,\;1$ which is divisible by three

Case 3: $e\equiv 1\;(mod\;3)$

From Combination 1, we have $0,\;0,\;1,\;1,\;1$ from which we can chose $1,\;1,\;1$ which is divisible by three

From Combination 2, we have $0,\;0,\;-1,\;-1,\;1$ from which we can chose $0,\;-1,\;1$ which is divisible by three

From Combination 3, we have $-1,\;-1,\;1,\;1,\;1$ from which we can chose $1,\;1,\;1$ which is divisible by three

And this proves that from any five integers, not necessarily distinct, one can always choose three of these integers whose sum is divisible by $3$

~Tomas Diaz. orders@tomasdiaz.com

Solution 2

Drawing a graph tree with nodes with all the modular possibilities and their paths chowing each path how it ends when a specific combination of three out of available numbers on that path, their summation is divisible by 3:

~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.

Page

Toolbox

Search

1970 Canadian MO Problems/Problem 7

Problem

Solution

Solution 2