Nuts Problem

Discrete Mathematics Level pending

There are \(N\) 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 how many values of \(N\), where\( N>2\) will the first player win? Answer\( -1\) if you think it is unbounded

×

Problem Loading...

Note Loading...

Set Loading...