Y by
Let
be a positive integer. Alex plays on a row of 9 squares as follows. Initially, all squares are empty. In each turn, Alex must perform exactly one of the following moves:
Choose a number of the form
, with
a non-negative integer, and place it in an empty square.
Choose two (not necessarily consecutive) squares containing the same number, say
. Replace the number in one of the squares with
and erase the number in the other square.
At the end of the game, one square contains the number
, while the other squares are empty. Determine, as a function of
, the maximum number of turns Alex can make.







At the end of the game, one square contains the number


This post has been edited 3 times. Last edited by EmersonSoriano, Apr 5, 2025, 5:26 PM
Reason: change
Reason: change