Maths Olympiad Prep

Library / /26 of 27

Combinatorics Difficulty 7.4 National olympiad, round 2 Prove it Austria

Initially, the numbers 1,2,,20241, 2, \ldots, 2024 are written on a blackboard. Trixi and Nana play a game, taking alternate turns. Trixi plays first.

The player whose turn it is chooses two numbers aa and bb, erases both, and writes their (possibly negative) difference aba - b on the blackboard. This is repeated until only one number remains on the blackboard after 20232023 moves. Trixi wins if this number is divisible by 33, otherwise Nana wins.

Which of the two has a winning strategy?

(Birgit Vera Schmidt)

Solution

We will prove that Nana has a winning strategy.

The only relevant property of all numbers in the game is their residue modulo 33. Therefore, we will call all numbers 00, 11 or 22 according to their residue, and we will also call 11s and 22s non-zeros.

We observe that each move either does not change the number of non-zeros (if one or two zeros are involved in the move) or decreases the number of non-zeros by 11 or 22 (if no zero is involved in the move).

Nana can play arbitrarily for a long time while the number of non-zeros decreases, until that number reaches 11, 22, 33 or 44 at the start of her move. This has to happen because it is not possible to go from 55 or more non-zeros to 00 non-zeros in two moves, and Trixi certainly cannot win as long as there are non-zeros on the blackboard.

If the number of non-zeros is 44, then Nana will avoid decreasing the number of non-zeros by using one or two zeros to force Trixi to decrease the number to 22 or 33. This has to happen because Trixi always starts a move with an even quantity of numbers, so she is the first one without zeros as long as there are 44 non-zeros.

If the number of non-zeros is 33, then two of them have the same value. Nana chooses these two and replaces them with zero. This leaves one non-zero which can change between 11 and 22, but never be removed until the end. So Nana wins.

If the number of non-zeros is 22, and they are distinct, then Nana replaces them with their difference 11 which again can never become zero.

If the number of non-zeros is 22 and they have the same value, then Nana will use one of them and a 00 to convert them to (1,2)(1, 2). This is possible because Nana always starts her move with an odd quantity of numbers, so she certainly has an available 00. If Trixi uses (1,2)(1, 2), she will lose since the last non-zero cannot be converted to zero. She also cannot use two zeros, because then Nana is in the previous case and wins. So Trixi has to convert one of them with an additional 00 to present Nana with two equal non-zeros. However, Nana can repeat her move until Trixi has not zeros left to do so. So Trixi will eventually be forced to use (1,2)(1, 2) and loses.

If there is just one non-zero left, Nana can play arbitrarily because this single non-zero will remain until the end of the game.

(Theresia Eisenkölzl) □

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.