SE-SKOLORNAS 1971 Problem 6
cards each have a label chosen from , such that no (non-empty) subset of the cards has labels with total divisible by . Show that the labels must all be equal.
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.