Skip to main content
OlympiadHQ

Browse · MathNet

Print

Selection Examination

Greece counting and probability

Problem

Twelve friends play a tennis tournament, where each player plays exactly one game with each of the eleven other players. The winner wins one point and the loser gets zero points, while there is no tie. If the number of points of the players are , find the maximum value of .
Solution
The 12 friends will play games, so the total number of points from all games is . One possible outcome of the tournament is to put all players in an order and each of them to win all players that are after of him in the order. Then the first one has points, the second one points and so on. Then the last one has points, and all the players have a different number of points from to . Then: We will prove that this is the maximum value for . Indeed, suppose that there is another outcome of the tournament which gives maximum and in that tournament the players and have the same number of points, let it be , where won . We observe that since won against . A new outcome will be produced if we suppose that won against , so would have points and will have points. If all the other games had the same outcome, then the difference between the new and the old one will be so the new is greater than the old one which we supposed that has the maximum , a contradiction. It follows that the maximum equals to and is reached with the above example.
Final answer
4356

Techniques

Invariants / monovariantsInduction / smoothingJensen / smoothing