CMO 1970 Problem 7
- Paper
Show that from any five integers, not necessarily distinct, one can always choose three of these integers whose sum is divisible by 3.
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.