Alice and Bob play the following game: starting with the number 2 written on a blackboard, each player in turn changes the current number n to a number n+p, where p is a prime divisor of n. 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 20202…2. Assuming perfect play, who will win the game.
Solution
Solution:
We prove that Alice wins the game. For argument's sake, suppose that Bob can win by proper play regardless of what Alice does on each of her moves. Note that Alice can force the line 2→4→6→8→10→12 at the beginning stages of the game. (As each intermediate 'position' from which Bob has to play is a prime power.) Thus the player on turn when the number 12 is written on the blackboard must be in a 'winning position', i.e., can win the game with skillful play. However, Alice can place herself in that position through the following line that is once again forced for Bob: 2→4→6→9→12. (This time she is in turn with 12 written on the blackboard.) The obtained contradiction proves our point.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.