ISL 2017 C3
Sir Alex plays the following game on a row of 9 cells. Initially, all cells are empty. In each move, Sir Alex is allowed to perform exactly one of the following two operations: (1) Choose any number of the form , where is a non-negative integer, and put it into an empty cell. (2) Choose two (not necessarily adjacent) cells with the same number in them; denote that number by . Replace the number in one of the cells with and erase the number in the other cell. At the end of the game, one cell contains the number , where is a given positive integer, while the other cells are empty. Determine the maximum number of moves that Sir Alex could have made, in terms of . (Thailand)
Dataset text NuminaMath olympiads. Quoted with source.
Official text: IMO 2017 Shortlist booklet, page 8.
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.