HMMT 2014 C7
- Combinatorics
- Answer
Six distinguishable players are participating in a tennis tournament. Each player plays one match of tennis against every other player. There are no ties in this tournament- each tennis match results in a win for one player and a loss for the other. Suppose that whenever and are players in the tournament such that wins strictly more matches than over the course of the tournament, it is also true that wins the match against in the tournament. In how many ways could the tournament have gone?
Dataset text NuminaMath olympiads. Quoted with source.
Show the answer
2048
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.