Maths Olympiad Prep

Library / /19 of 24

Combinatorics Difficulty 6.6 National Olympiad Prove it Croatia

On a 2017×20172017 \times 2017 board, some of the squares are occupied by a single ladybird; the rest of the squares are empty. The ladybirds move, never leaving the board, according to the following principles. Every second, each ladybird moves to a neighbouring square. The moves are horizontal (to the square immediately to the right or to the left of the current square), or vertical (to the square above or below the one currently occupied). A ladybird which makes a horizontal move must move vertically in its next move. Similarly, a ladybird which makes a vertical move must move horizontally in its next move.

Determine the smallest number of ladybirds such that, regardless of their initial positions and their chosen paths, we may be sure that two of them will eventually find themselves in the same square, at the same moment.

(P. Soberón, Problem-Solving Methods in Combinatorics)

Solution

We claim that the required number is 20162+12016^2 + 1. Let us first show that we can find an arrangement of 201622016^2 ladybirds and choose their paths so that no two occupy the same square at the same moment in time. We place the ladybirds in the lower left 2016×20162016 \times 2016 square of the board and let them all move in the same manner: up, right, down, left, up, right... We see that no two ladybirds will meet after the first 4

Figure 1

seconds. Since we arrive at the initial position after that, we see that no two ladybirds will ever occupy the same square at the same time.

We now show that, if the board contains 20162+12016^2 + 1 ladybirds, a collision must occur, regardless of the initial arrangement and the ladybirds' paths.

We label the squares with one of the four labels, AA, BB, CC and DD, so that the squares in odd rows alternate between labels AA and BB, while the squares in even rows alternate between CC and DD. We will call a square which has been labelled by AA an AA-square.

Figure 2

Two observations are crucial for our solution. A ladybird occupying a BB-square or a CC-square will after one second move to an AA-square or a DD-square. Similarly, a ladybird which occupies an AA-square will after two seconds be sitting in a DD-square.

The board contains 20162+12016^2 + 1 ladybirds, so we can assume that at least 10082016+11008 \cdot 2016 + 1 of them occupy an AA- or a DD-square. If the opposite were true, we would have at least 10082016+11008 \cdot 2016 + 1 on a BB-square or a CC-square, so that after one second we would arrive at the desired situation. Since the number of DD-squares equals 100821008^2, the AA-squares contain at least 10082+11008^2 + 1 ladybirds.

All the ladybirds which are now occupying the AA-squares will after two seconds move to DD-squares. This means that there will be at least 10082+11008^2 + 1 ladybirds on 100821008^2 DD-squares, so that at least two of them will be in the same square.

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.