olymmath

ISL 2022 C4

Let n>3n>3 be a positive integer. Suppose that nn children are arranged in a circle, and nn coins are distributed between them (some children may have no coins). At every step, a child with at least 2 coins may give 1 coin to each of their immediate neighbours on the right and left. Determine all initial distributions of coins from which it is possible that, after a finite number of steps, each child has exactly one coin.

Dataset text NuminaMath olympiads. Quoted with source.

Official text: IMO 2022 Shortlist booklet, page 6.

Show the answer

All distributions where \sum_{i=1}^{n} i c_{i}=\frac{n(n+1)}{2}(\bmod n)

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.

Locator isl/2022/c4 · Tag H35Y5JH0R2 · Edit this page on GitHub · Keys: j next, k previous