ISL 2015 C4
Let be a positive integer. Two players and play a game in which they take turns choosing positive integers . The rules of the game are: (i) A player cannot choose a number that has been chosen by either player on any previous turn. (ii) A player cannot choose a number consecutive to any of those the player has already chosen on any previous turn. (iii) The game is a draw if all numbers have been chosen; otherwise the player who cannot choose a number anymore loses the game. The player takes the first turn. Determine the outcome of the game, assuming that both players use optimal strategies. (Finland)
Dataset text NuminaMath olympiads. Quoted with source.
Official text: IMO 2015 Shortlist booklet, page 5.
Solutions
Official solution Solution 1 by the IMO Problem Selection Committee
The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).
Similar problems
These problems have the most words in common with this statement.