Problem Three: How Many coins?
Oct 26th, 2006 by tony
Tony and Janet decide to play a game to settle their differences. The game begins with N coins. They alternate turns with Tony going first. Every turn, they must remove one, three or four coins from the table. The player who takes the last coin wins the game. For which values of N between 31 and 35 inclusive does Janet have a guaranteed winning strategy?
Update: Solutions are posted!