Maths Olympiad Prep

Library / /55 of 57

, 2008

Combinatorics Difficulty 7.1 National Olympiad, round 2 Prove it JBMO

Problem:
Every cell of table 4×44 \times 4 is colored into white. It is permitted to place the cross (pictured below) on the table such that its center lies on the table (the whole figure does not need to lie on the table) and change colors of every cell which is covered into opposite (white and black). Find all nn such that after nn steps it is possible to get the table with every cell colored black.

Figure 1

Solution

Solution:
The cross covers at most five cells so we need at least 4 steps to change the color of every cell. If we place the cross 4 times such that its center lies in the cells marked below, we see that we can turn the whole square black in n=4n=4 moves.

Figure 2

Furthermore, applying the same operation twice ("do and undo"), we get that it is possible to turn all the cells black in nn steps for every even n4n \geq 4.

We shall prove that for odd nn it is not possible to do that. Look at the picture below.

Figure 3

Let kk be a difference between white and black cells in the green area in picture. Every figure placed on the table covers an odd number of green cells, so after every step kk is changed by a number 2(mod4)\equiv 2 (\bmod 4). At the beginning k=10k=10, at the end k=10k=-10. From this it is clear that we need an even number of steps.

Solution for nn is: every even number except 22.

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 reproduced verbatim; metadata (topic, difficulty) added by this project.