OPM 2000 Problem 6
- Final day 2
In a tournament, players participate. Each player plays each other exactly once, with no ties. A player is said to be champion if, for every other player , one of the following two situations occurs: (a) beat ; (b) beat a player who in turn beat . Prove that in such a tournament there cannot be exactly two champions.
Dataset text AI-MO AoPS. Quoted with source.
Official text: Portuguese Mathematical Olympiad 2000 official paper, page 1.
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.