benchmarks.wiki / Public workspace

Omni-MATH / Six soccer teams are competing in a tournament in Waterloo. Every team is to…

Problem

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

problem

Six soccer teams are competing in a tournament in Waterloo. Every team is to play three games, each against a different team. How many different schedules are possible?

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