BALKAN 2018 Problem 3
- Paper
- Combinatorics
Alice and Bob play the following game: They start with two non-empty piles of coins. Taking turns, with Alice playing first, each player chooses a pile with an even number of coins and moves half of the coins of this pile to the other pile. The game ends if a player cannot move, in which case the other player wins. Determine all pairs of positive integers such that if initially the two piles have and coins respectively, then Bob has a winning strategy.
Dataset text NuminaMath olympiads. Quoted with source.
Also BALKAN-SL 2018 C2.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.