olymmath

JBMO-SL 2020 C1

Alice and Bob play the following game: starting with the number 2 written on a blackboard, each player in turn changes the current number nn to a number n+pn+p, where pp is a prime divisor of nn. Alice goes first and the players alternate in turn. The game is lost by the one who is forced to write a number greater than 2…2⏟2020\underbrace{2 \ldots 2}_{2020}. Assuming perfect play, who will win the game.

Dataset text NuminaMath olympiads. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator jbmo-sl/2020/c1 · Tag KD3A2SG5T4 · Edit this page on GitHub · Keys: j next, k previous