MathDB
RMM 2019 Problem 1

Source: RMM 2019

February 23, 2019
RMMRMM 2019number theory

Problem Statement

Amy and Bob play the game. At the beginning, Amy writes down a positive integer on the board. Then the players take moves in turn, Bob moves first. On any move of his, Bob replaces the number nn on the blackboard with a number of the form na2n-a^2, where aa is a positive integer. On any move of hers, Amy replaces the number nn on the blackboard with a number of the form nkn^k, where kk is a positive integer. Bob wins if the number on the board becomes zero. Can Amy prevent Bob’s win?
Maxim Didin, Russia