BY-MO 1995 Problem 7
The expression is written on a blackboard. Bill and Peter play the following game. They replace by or , making their moves in turn, and one of them can use only , while the other one can use only . At the beginning, Bill selects the sign he will use, and he tries to make the result an even number. Peter tries to make the result an odd number. Prove that Peter can always win.
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.