Question 14
A pile contains more than $n^2$ stones. Pete and Basil alternately take stones, Pete first. A move may take $k$ stones if $k=1$, or $k$ is prime and less than $n$, or $n$ divides $k$. Whoever takes the last stone wins. Prove that Pete has a winning strategy. (S. Berlov)