ISL 2010 C4
Six stacks of coins are standing in a row. In the beginning every stack contains a single coin. There are two types of allowed moves: Move 1: If stack with contains at least one coin, you may remove one coin from and add two coins to . Move 2: If stack with contains at least one coin, then you may remove one coin from and exchange stacks and . Decide whether it is possible to achieve by a sequence of such moves that the first five stacks are empty, whereas the sixth stack contains exactly coins. Same as Problem C4, but the constant is replaced by . (Netherlands)
Dataset text NuminaMath olympiads. Quoted with source.
Official text: IMO 2010 Shortlist booklet, page 31.
Solutions
Official solution Solution 1 by the IMO Problem Selection Committee
The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).
Similar problems
These problems have the most words in common with this statement.