Question 3
A pile contains $n$ stones. Two players alternate taking either one stone or $p$ stones, where $p$ is a prime divisor of the current pile size. The player taking the last stone wins. For which positive integers $n$ can the first player force a win?
