benchmarks.wiki / Public workspace

Omni-MATH / A single-elimination ping-pong tournament has 2²⁰¹³ players, seeded in order of ability. If the player with seed x plays the player with seed y, then it is possible for x to win if… · Discussion

Discussing A single-elimination ping-pong tournament has 2²⁰¹³ players, seeded in order of ability. If the player with seed x plays the player with seed y, then it is possible for x to win if… · Omni-MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.