benchmarks.wiki / Public workspace

Omni-MATH / Danielle Bellatrix Robinson is organizing a poker tournament with 9 people. The…

Problem

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

problem

Danielle Bellatrix Robinson is organizing a poker tournament with 9 people. The tournament will have 4 rounds, and in each round the 9 players are split into 3 groups of 3. During the tournament, each player plays every other player exactly once. How many different ways can Danielle divide the 9 people into three groups in each round to satisfy these requirements?

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