Olympiad Maths Prep

Library / /22 of 28

Combinatorics Difficulty 6.0 National olympiad Prove it Ukraine

The knight stands in the left lower corner of a 2009×20092009 \times 2009 chessboard and it is known that the first column and the last row are colored in red. The knight moves on the chessboard according to the chess rules but it can't get on the cell which is already colored in red. After every move of the knight we color in red the column and the row that contain the cell on which the knight has just got. Is it possible to color the whole chessboard in red if we act as described above?

Figure 1
Fig.15

Solution

As it is shown on the fig.15, we can color in red the first four columns and the first four rows of the chessboard. Now consider our chessboard without these four columns and rows. As we can see on the same figure, the fifth move of the knight brings it to the left lower corner of the new reduced 2005×20052005 \times 2005 chessboard. If we continue reducing our chessboard in the same way, then after 501 iterations we will receive a 5×55 \times 5 chessboard, which can be colored in red as shown on the fig.16.

Figure 2
Fig.16

Looking for a route rather than 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.