The number of stones removed at each turn must be one less than a prime number. Alice goes first.
The winner is the player who takes the last stone.
Prove that there are infinitely many values of n such that Bob has a winning strategy.


perplexus dot info 


