This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 1

2020 Australian Maths Olympiad, 2
Amy and Bec play the following game. Initially, there are three piles, each containing $2020$ stones. The players take turns to make a move, with Amy going first. Each move consists of choosing one of the piles available, removing the unchosen pile(s) from the game, and then dividing the chosen pile into $2$ or $3$ non-empty piles. A player loses the game if he/she is unable to make a move. Prove that Bec can always win the game, no matter how Amy plays.
amo combinatorial game game game strategy combinatorial games modular arithmetic