Alice and Bob play a game in which they take turns removing stones from a heap that initially has n stones.
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.

(In reply to Mapping out a bit by Jer)

Let's play flagle adventure game together. It's so amazed. 

Posted by Evelyn Brahm on 2023-01-27 21:46:39