Question 34
Players take turns in choosing numbers from the set $\{1, 2, 3, \ldots, 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$?