Skip to main content
OlympiadHQ

Browse · MathNet

Print

22nd Junior Turkish Mathematical Olympiad

Turkey counting and probability

Problem

In the chess tournament organized in a school consisting of students every two students played at most one match among themselves. At the end of the tournament it turned out that if two students played a match then at least one of them played at most matches in total. What is the maximal possible number of matches in the tournament?
Solution
The answer is . Let us divide the students into two groups consisting of and students. If each student played a match with each student of other group and no matches are played between students from the same group then the conditions are satisfied and there are matches.

Let us show that total number of matches can not exceed . A student is said to be active if she played more than matches. Note that no match is played between two active students. If the number of non-active students is not exceeding then the total number of matches is at most .

Now suppose that the number of non-active students is for some positive integer . Then the number of active students is . The total number of matches is at most . The total number of matches involving active students is at most . The remaining matches are played between non-active students and are counted twice. Therefore, the total number of matches is at most
Final answer
43890

Techniques

Counting two waysColoring schemes, extremal arguments