Browse · MathNet
PrintXXI OBM
Brazil counting and probability
Problem
There are football teams in Tumbólia. A championship is to be organized in which each team plays against every other exactly once. Every match takes place on Sundays and one team must not play more than once in the same day. Find the least integer for which it's possible to set up a championship lasting Sundays.
Solution
First case: is even. Let be the teams. Each team shall play times on at least Sundays. Let us show that Sundays are sufficient to set up the championship.
Teams and play on the -th Sunday. Define by the following rules: Let us show that implies . If , we have . Since , we must have . If and , , which implies . If and and , we have , which implies , absurd. Hence . Thus Sundays are sufficient to set up the championship.
Second case: is odd. Each team must play times on at least Sundays. However on each Sunday at least one team does not play. Hence . Let us prove that Sundays are sufficient. Let be a "dummy" team. If plays against on a given Sunday, it means that doesn't play on that Sunday. Thus we have teams. As is even, as shown above, we know that Sundays are sufficient.
Teams and play on the -th Sunday. Define by the following rules: Let us show that implies . If , we have . Since , we must have . If and , , which implies . If and and , we have , which implies , absurd. Hence . Thus Sundays are sufficient to set up the championship.
Second case: is odd. Each team must play times on at least Sundays. However on each Sunday at least one team does not play. Hence . Let us prove that Sundays are sufficient. Let be a "dummy" team. If plays against on a given Sunday, it means that doesn't play on that Sunday. Thus we have teams. As is even, as shown above, we know that Sundays are sufficient.
Final answer
n-1 if n is even; n if n is odd
Techniques
Matchings, Marriage Lemma, Tutte's theoremColoring schemes, extremal arguments