Maths Olympiad Prep

Library / International Mathematical Olympiad /39 of 110

International Mathematical Olympiad

Combinatorics Difficulty 8.2 Shortlist Prove it IMO

Let k⩾2k \geqslant 2 be an integer. Find the smallest integer n⩾k+1n \geqslant k+1 with the property that there exists a set of nn distinct real numbers such that each of its elements can be written as a sum of kk other distinct elements of the set.

Solution

First we show that n⩾k+4n \geqslant k+4. Suppose that there exists such a set with nn numbers and denote them by a1<a2<⋯<ana_{1} < a_{2} < \cdots < a_{n}.
Note that in order to express a1a_{1} as a sum of kk distinct elements of the set, we must have a1⩾a2+⋯+ak+1a_{1} \geqslant a_{2} + \cdots + a_{k+1} and, similarly for ana_{n}, we must have an−k+⋯+an−1⩾ana_{n-k} + \cdots + a_{n-1} \geqslant a_{n}. We also know that n⩾k+1n \geqslant k+1.
If n=k+1n = k+1 then we have a1⩾a2+⋯+ak+1>a1+⋯+ak⩾ak+1a_{1} \geqslant a_{2} + \cdots + a_{k+1} > a_{1} + \cdots + a_{k} \geqslant a_{k+1}, which gives a contradiction.
If n=k+2n = k+2 then we have a1⩾a2+⋯+ak+1⩾ak+2a_{1} \geqslant a_{2} + \cdots + a_{k+1} \geqslant a_{k+2}, that again gives a contradiction.
If n=k+3n = k+3 then we have a1⩾a2+⋯+ak+1a_{1} \geqslant a_{2} + \cdots + a_{k+1} and a3+⋯+ak+2⩾ak+3a_{3} + \cdots + a_{k+2} \geqslant a_{k+3}. Adding the two inequalities we get a1+ak+2⩾a2+ak+3a_{1} + a_{k+2} \geqslant a_{2} + a_{k+3}, again a contradiction.
It remains to give an example of a set with k+4k+4 elements satisfying the condition of the problem. We start with the case when k=2lk = 2l and l⩾1l \geqslant 1. In that case, denote by Ai={−i,i}A_{i} = \{-i, i\} and take the set A1∪⋯∪Al+2A_{1} \cup \cdots \cup A_{l+2}, which has exactly k+4=2l+4k+4 = 2l+4 elements. We are left to show that this set satisfies the required condition.
Note that if a number ii can be expressed in the desired way, then so can −i-i by negating the expression. Therefore, we consider only 1⩽i⩽l+21 \leqslant i \leqslant l+2.
If i<l+2i < l+2, we sum the numbers from some l−1l-1 sets AjA_{j} with j≠1,i+1j \neq 1, i+1, and the numbers i+1i+1 and −1-1.
For i=l+2i = l+2, we sum the numbers from some l−1l-1 sets AjA_{j} with j≠1,l+1j \neq 1, l+1, and the numbers l+1l+1 and 11.
It remains to give a construction for odd k=2l+1k = 2l+1 with l⩾1l \geqslant 1 (since k⩾2k \geqslant 2). To that end, we modify the construction for k=2lk = 2l by adding 00 to the previous set.
This is a valid set as 00 can be added to each constructed expression, and 00 can be expressed as follows: take the numbers 1,2,−31, 2, -3 and all the numbers from the remaining l−1l-1 sets A4,A5,⋯ ,Al+2A_{4}, A_{5}, \cdots, A_{l+2}.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.