benchmarks.wiki / Public workspace

Omni-MATH / 20 players are playing in a Super Smash Bros. Melee tournament. They are ranked…

Problem

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

problem

20 players are playing in a Super Smash Bros. Melee tournament. They are ranked 1−201-20, and player nn will always beat player mm if n<mn<m. Out of all possible tournaments where each player plays 18 distinct other players exactly once, one is chosen uniformly at random. Find the expected number of pairs of players that win the same number of games.
Plain-text mathematical notation (without MathML)
20 players are playing in a Super Smash Bros. Melee tournament. They are ranked 1−20, and player n will always beat player m if n<m. Out of all possible tournaments where each player plays 18 distinct other players exactly once, one is chosen uniformly at random. Find the expected number of pairs of players that win the same number of games.
Original LaTeX notation
20 players are playing in a Super Smash Bros. Melee tournament. They are ranked $1-20$, and player $n$ will always beat player $m$ if $n<m$. Out of all possible tournaments where each player plays 18 distinct other players exactly once, one is chosen uniformly at random. Find the expected number of pairs of players that win the same number of games.

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