RU-ALLRUSSIAN 1972 Problem 10
Two players play the following game. At each turn the first player chooses a decimal digit, then the second player substitutes it for one of the stars in the subtraction | **** - **** |. The first player tries to end up with the largest possible result, the second player tries to end up with the smallest possible result. Show that the first player can always play so that the result is at least 4000 and that the second player can always play so that the result is at most 4000.
Dataset text NuminaMath olympiads. 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.