Y by
Players
and
play a game with a stack of
coins. Beginning with
, each player takes turns to choose a prime
and remove
coins from the stack. The player who takes the last coin wins. Prove that there are infinitely many integers
such that
has a winning strategy.







