olymmath

ISL 2022 C6

Let nn be a positive integer. We start with nn piles of pebbles, each initially containing a single pebble. One can perform moves of the following form: choose two piles, take an equal number of pebbles from each pile and form a new pile out of these pebbles. For each positive integer nn, find the smallest number of non-empty piles that one can obtain by performing a finite sequence of moves of this form. (Croatia)

Official text Transcription from NuminaMath olympiads, checked word for word against the official paper. Quoted with source.

Official text: IMO 2022 Shortlist booklet, page 7.

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/c6 · Tag 7500PHP9GR · Edit this page on GitHub · Keys: j next, k previous