AoPSWiki
Math Zoom Summer Program in Sunny Los Angeles: World renowned coaches and proven curricula. Learn problem-solving, expand math horizons, win in math contests. Make friends and have fun!
Sponsored Ad
Personal tools

2006 Romanian NMO Problems/Grade 9/Problem 4

From AoPSWiki

Problem

\displaystyle 2n students \displaystyle (n \geq 5) participated at table tennis contest, which took \displaystyle 4 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;
  • there are \displaystyle 3 students on the second place;
  • no student lost all \displaystyle 4 matches.

How many students won only a single match and how many won exactly \displaystyle 2 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.

See also

Art of Problem Solving's olympiad training program WOOT starts on September 8. Train with the top high school students in the the world! Click here to enroll today!
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us