olymmath

ISL 2013 C1

Let nn be a positive integer. Find the smallest integer kk with the following property: Given any real numbers a1,…,ada_{1}, \ldots, a_{d} such that a1+a2+⋯+ad=na_{1}+a_{2}+\cdots+a_{d}=n and 0⩽ai⩽10 \leqslant a_{i} \leqslant 1 for i=1,2,…,di=1,2, \ldots, d, it is possible to partition these numbers into kk groups (some of which may be empty) such that the sum of the numbers in each group is at most 1 . (Poland)

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

Official text: IMO 2013 Shortlist booklet, page 4.

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/2013/c1 · Tag B65GKFETW5 · Edit this page on GitHub · Keys: j next, k previous