BALTIC-WAY 2011 Problem 10
Two persons play the following game with integers. The initial number is . The players move in turns. Each move consists of subtraction of an integer between and inclusive, or division by , rounding down to the closest integer when necessary. The player who first obtains a non-positive integer wins. Which player has a winning strategy?
Dataset text AI-MO AoPS. 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.
Similar problems
These problems have the most words in common with this statement.