RU-ALLRUSSIAN 1977 Problem 11
Given a sequence , , ..., of positive integers. Let S be the set of all sums of one or more members of the sequence. Show that S can be divided into n subsets such that the smallest member of each subset is at least half the largest member.
Dataset text NuminaMath olympiads. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.