NL-NWO 2009 Problem 3
A tennis tournament has at least three participants. Every participant plays exactly one match against every other participant. Moreover, every participant wins at least one of the matches he plays. (Draws do not occur in tennis matches.) Show that there are three participants and for which the following holds: wins against wins against , and wins against .
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.