AUSTRIAN-POLISH 1990 Problem 9
is a sequence of integers such that every non-empty subsequence has non-zero sum. Show that we can partition the positive integers into a finite number of sets such that if all belong to the same set, then is non-zero.
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.