MathDB
game

Source: Ukraine 1997

July 18, 2009
combinatorics proposedcombinatorics

Problem Statement

There are n n candidates on a table. Petrik and Mikola alternately take candies from the table according to the following rule. Petrik starts by taking one candy; then Mikola takes i i candies, where i i divides 2 2, then Petrik takes j j candies, where j j divides 3 3, and so on. The player who takes the last candy wins the game. Which player has a winning strategy?
Back to ProblemsView on AoPS