Maths Olympiad Prep

Library / /13 of 16

Combinatorics Difficulty 6.8 National olympiad Prove it Brazil

There are 20092009 pebbles in some points (x,y)(x, y) with both coordinates integer. An operation consists in choosing a point (a,b)(a, b) with four or more pebbles, removing four pebbles from (a,b)(a, b) and putting one pebble in each of the points
(a,b1),(a,b+1),(a1,b),(a+1,b) (a, b - 1), (a, b + 1), (a - 1, b), (a + 1, b)
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 SS be the sum of the squares of the coordinates of the pebbles. Each operation takes four pebbles at (x,y)(x, y) to one pebble at each of the points (x1,y)(x-1, y), (x+1,y)(x+1, y), (x,y1)(x, y-1), (x,y+1)(x, y+1), so each operation increases SS by
(x1)2+y2+(x+1)2+y2+x2+(y1)2+x2+(y+1)24(x2+y2)=4.(x-1)^2 + y^2 + (x+1)^2 + y^2 + x^2 + (y-1)^2 + x^2 + (y+1)^2 - 4(x^2 + y^2) = 4.
It is easy to see that the baricenter GG of the pebbles doesn't change.

Let GG be the graph whose vertices are the pebbles and we connect two vertices if the distance between the corresponding pebbles is less than MM, M>2M > 2 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 a,ba, b surpasses MM, then one of the pebbles, say aa, was moved; then one of the other three pebbles moved gets closer to bb, and is at a distance at most 22 from aa, so there is still a path leading aa to bb. This, added to the fact that GG is invariant, proves that the pebbles cannot go too far from GG; indeed, all pebbles are contained in a disk with center GG and radius 2009M2009M.

Since SS always increases by 44, the number of operations cannot be arbitrarily large, because if it isn't the case, SS 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 SS maximum that can lead to more than one final configuration. This means that all configurations with higher values of SS can only lead to one final configuration. Then one can perform the operation at two distinct points AA and BB, leading to configurations AA and BB, respectively, that lead to different final configurations. Note that AA and BB have higher values of SS, 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 BB in AA and at AA in BB, 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.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.