benchmarks.wiki / Public workspace

Omni-MATH / Six distinguishable players are participating in a tennis tournament. Each…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

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 AA and BB are players in the tournament such that AA wins strictly more matches than BB over the course of the tournament, it is also true that AA wins the match against BB in the tournament. In how many ways could the tournament have gone?
Plain-text mathematical notation (without MathML)
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 A and B are players in the tournament such that A wins strictly more matches than B over the course of the tournament, it is also true that A wins the match against B in the tournament. In how many ways could the tournament have gone?
Original LaTeX notation
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 $A$ and $B$ are players in the tournament such that $A$ wins strictly more matches than $B$ over the course of the tournament, it is also true that $A$ wins the match against $B$ in the tournament. In how many ways could the tournament have gone?

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import