olymmath

PMO 2016 Problem 4

    Two players, AA (first player) and BB, take alternate turns in playing a game using 2016 chips as follows: the player whose turn it is, must remove ss chips from the remaining pile of chips, where s∈{2,4,5}s \in \{ 2,4,5 \}. No one can skip a turn. The player who at some point is unable to make a move (cannot remove chips from the pile) loses the game. Who among the two players can force a win on this game?

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator ph-pmo/2016/p4 · Tag GV471A2VZB · Edit this page on GitHub · Keys: j next, k previous