2006 Romanian NMO Problems/Grade 9/Problem 4
From AoPSWiki
Problem
students
participated at table tennis contest, which took
days. Every day, every student played a match. (It is possible that the same pair meets two or more times, in different days). Prove that it is possible that the contest ends like this:
- there is only one winner;
How many students won only a single match and how many won exactly
matches? (In the above conditions)
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.






