RU-ALLRUSSIAN 1973 Problem 10
n people are all strangers. Show that you can always introduce some of them to each other, so that afterwards each person has met a different number of the others. [problem: this is false as stated. Each person must have 0, 1, ... or n- 1 meetings, so all these numbers must be used. But if one person has met no one, then another cannot have met everyone.]
Dataset text NuminaMath olympiads. 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.