CZ-SK-MO 1998 Problem 2
Given any set of (different) natural numbers, prove that for some ( ) there exist two disjoint -element subsets and such that and differ by less than , i.e.
Dataset text AI-MO AoPS. 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.
Similar problems
These problems have the most words in common with this statement.