There are two players and there are N identical objects in a pile. Player 1 and Player 2 alternate moves. Initially, Player 1 must remove 1 object. From then on, each player must remove anywhere from 1 to twice as many pieces as his opponentjustremoved. Who, if anyone, has a winning strategy (as a function of N)? Prove it!