Two players play alternately. The first player is given a pair of positive integers . Each player must replace the pair that he is given by a pair of non-negative integers such that and for some positive integer . The first player to pass on a pair with wins. Find for which values of the first player has a winning strategy.
Solution
Note first that draws are not possible so any position is either a win or a loss for the player receiving it. Let be the positive root of , so . Let , . We show that a player receiving wins if and only if or .
If and , then the player must pass on and . So it is sufficient to show that a player receiving a position with can either win or pass back a position with and such that and .
If , and is a multiple of , then the player can pass on and win. So assume and with . If , then the player can choose whether to pass on or . If is a losing position, then he wins by passing that. If it is a winning position, then
he passes to the other player. The other player is now forced to pass back , which is a winning position. So we may assume . Now the player passes . We claim that and . Certainly . But , so , so .