Skip to main content
OlympiadHQ

Browse · MathNet

Print

XXXI Brazilian Math Olympiad

Brazil counting and probability

Problem

There are pebbles in some points with both coordinates integer. An operation consists in choosing a point with four or more pebbles, removing four pebbles from and putting one pebble in each of the points Show that after a finite number of operations each point will necessarily have at most three pebbles. Prove that the final configuration doesn't depend on the order of the operations.
Solution
For each configuration that can be obtained, let be the sum of the squares of the coordinates of the pebbles. Each operation takes four pebbles at to one pebble at each of the points , , , , so each operation increases by It is easy to see that the baricenter of the pebbles doesn't change.

Let be the graph whose vertices are the pebbles and we connect two vertices if the distance between the corresponding pebbles is less than , sufficiently large to make the graph connected. One can easily check that the graph remains connected after performing the operation: in fact, if the distance between two pebbles surpasses , then one of the pebbles, say , was moved; then one of the other three pebbles moved gets closer to , and is at a distance at most from , so there is still a path leading to . This, added to the fact that is invariant, proves that the pebbles cannot go too far from ; indeed, all pebbles are contained in a disk with center and radius .

Since always increases by , the number of operations cannot be arbitrarily large, because if it isn't the case, would go to infinity, and one of the pebbles' coordinates would go to infinity as well, which is not possible. Hence the number of operations is always finite.

Now let's prove that the final configuration doesn't depend on the order of the operations. Suppose that it does and consider, of all possible configurations that can be obtained, one with maximum that can lead to more than one final configuration. This means that all configurations with higher values of can only lead to one final configuration. Then one can perform the operation at two distinct points and , leading to configurations and , respectively, that lead to different final configurations. Note that and have higher values of , so each one leads to its only one final configuration, no matter what is the order of the following operations. But one can perform the operation at in and at in , and these operations lead to the same configuration, which is a contradiction. So the final configuration doesn't depend on the order of the operations.

Techniques

Invariants / monovariantsColoring schemes, extremal arguments