MathDB

Players A and B play a game. They are given a box with

n=>1

candies. A starts first. On a move, if in the box there are

k

candies, the player chooses positive integer

l

so that

l<=k

and

(l, k) =1

, and eats

l

candies from the box. The player who eats the last candy wins. Who has winning strategy, in terms of

n

Problem Statement