MEMO 2013 Problem 8
The expression is written on the blackboard. Two players, and , play a game, taking turns. Player takes the first turn. In each turn, the player on turn replaces a symbol by a positive integer. After all the symbols are replace, player replaces each of the signs by either + or -, independently of each other. Player wins if the value of the expression on the blackboard is not divisible by any of the numbers . Otherwise, player wins. Determine 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.