TT2008 Senior A-Level - P3
Source:
September 4, 2010
symmetrycombinatorics unsolvedcombinatorics
Problem Statement
There are piles each consisting of a single nut. Two players in turns play the following game. At each move, a player combines two piles that contain coprime numbers of nuts into a new pile. A player who can not make a move, loses. For every determine which of the players, the first or the second, has a winning strategy.