IrMO 2018 Problem 1
- Paper 1
Mary and Pat play the following number game. Mary picks an initial integer greater than . She then multiplies this number by and adds to the result. Pat will add to this new number and it will again be Mary's turn. Both players will continue to take alternating turns. Mary will always multiply the current number by and add to the result when it is her turn. Pat will always add to the current number when it is his turn. Pat wins if any of the numbers obtained by either player is divisible by . Mary wants to prevent Pat from winning the game. Determine, with proof, the smallest initial integer Mary could choose in order to achieve this.
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.