IL-GILLIS 2019 Problem 4
In the beginning, the number 1 is written on the board 9999 times. We are allowed to perform the following actions:
- Erase four numbers of the form , and instead write the two numbers . (The order or location of the erased numbers does not matter)
- Erase the number 0 from the board, if it's there. [/list] Is it possible to reach a state where: [list=a]
- Only one number remains on the board?
- At most three numbers remain on the board?
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.