olymmath

Putnam 2012 B3

  • Session B

A round-robin tournament of 2n2n teams lasted for 2n−12n-1 days, as follows. On each day, every team played one game against another team, with one team winning and one team losing in each of the nn games. Over the course of the tournament, each team played every other team exactly once. Can one necessarily choose one winning team from each day without choosing any team more than once?

Curated text Kedlaya Putnam archive. Quoted with source.

Solutions

Human solution Solution 1 by Kiran Kedlaya and Lenny Ng

The terms of the source let olymmath link to this solution but not copy it. Read the solution (Kedlaya Putnam archive).

Similar problems

These problems have the most words in common with this statement.

Locator putnam/2012/b3 · Tag A27QW6069E · Edit this page on GitHub · Keys: j next, k previous