IMO 1972 Problem 1
- Day 1
Prove that from a set of ten distinct two-digit numbers, it is always possible to find two disjoint subsets whose members have the same sum.
Dataset text AI-MO AoPS. Quoted with source.
Official text: IMO 1972 official English paper, page 1.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.