olymmath

ISL 2021 C2

Let n⩾3n \geqslant 3 be an integer. An integer m⩾n+1m \geqslant n+1 is called nn-colourful if, given infinitely many marbles in each of nn colours C1,C2,…,CnC_{1}, C_{2}, \ldots, C_{n}, it is possible to place mm of them around a circle so that in any group of n+1n+1 consecutive marbles there is at least one marble of colour CiC_{i} for each i=1,…,ni=1, \ldots, n. Prove that there are only finitely many positive integers which are not nn-colourful. Find the largest among them.

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

Official text: IMO 2021 Shortlist booklet, page 6.

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/2021/c2 · Tag EXPQ00J56D · Edit this page on GitHub · Keys: j next, k previous