MathDB

Three friends Archie, Billie, and Charlie play a game. At the beginning of the game, each of them has a pile of

2024

pebbles. Archie makes the first move, Billie makes the second, Charlie makes the third and they continue to make moves in the same order. In each move, the player making the move must choose a positive integer

n

greater than any previously chosen number by any player, take

2n

pebbles from his pile and distribute them equally to the other two players. If a player cannot make a move, the game ends and that player loses the game.

\hspace{5px}

Determine all the players who have a strategy such that, regardless of how the other two players play, they will not lose the game.
Proposed by Ilija Jovčeski, Macedonia

Problem Statement