ISL 2019 A3
Let be a positive integer and let be a strictly increasing sequence of positive real numbers with sum equal to 2 . Let be a subset of such that the value of is minimised. Prove that there exists a strictly increasing sequence of positive real numbers with sum equal to 2 such that (New Zealand) Common remarks. In all solutions, we say an index set is -minimising if it has the property in the problem for the given sequence . Write for the complement of , and for the interval of integers such that . Note that so we may exchange and where convenient. Let and note that is -minimising if and only if it minimises , and that if and only if . In some solutions, a scaling process is used. If we have a strictly increasing sequence of positive real numbers (typically obtained by perturbing the in some way) such that then we may put . So it suffices to construct such a sequence without needing its sum to be 2 . The solutions below show various possible approaches to the problem. Solutions 1 and 2 perturb a few of the to form the (with scaling in the case of Solution 1, without scaling in the case of Solution 2). Solutions 3 and 4 look at properties of the index set . Solution 3 then perturbs many of the to form the , together with scaling. Rather than using such perturbations, Solution 4 constructs a sequence directly from the set with the required properties. Solution 4 can be used to give a complete description of sets that are -minimising for some .
Dataset text NuminaMath olympiads. Quoted with source.
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.