AoPSWiki
Want to learn how to tackle those tough AMC/AIME/Olympiad algebra problems? Check out Art of Problem Solving's Intermediate Algebra by Richard Rusczyk and Mathew Crawford. Over 1600 problems!

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

Want to learn how to tackle those tough MATHCOUNTS and AMC counting and probability problems? Check out Art of Problem Solving's Introduction to Counting & Probability by David Patrick.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us