RU-ALLRUSSIAN 1987 Problem 15
Players take turns in choosing numbers from the set {1, 2, 3, ..., n}. Once m has been chosen, no divisor of m may be chosen. The first player unable to choose a number loses. Who has a winning strategy for n = 10? For n = 1000?
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.