ISL 2019 C2
You are given a set of blocks, each weighing at least 1 ; their total weight is . Prove that for every real number with you can choose a subset of the blocks whose total weight is at least but at most . (Thailand)
Official text Transcription from NuminaMath olympiads, checked word for word against the official paper. Quoted with source.
Official text: IMO 2019 Shortlist booklet, page 8.
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.