Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2006 Romanian NMO Problems/Grade 9/Problem 4"
Line 12: Line 12:
 
==See also==
 
==See also==
 
*[[2006 Romanian NMO Problems]]
 
*[[2006 Romanian NMO Problems]]
 +
[[Category: Olympiad Combinatorics Problems]]

Revision as of 10:15, 28 July 2006

Problem

$\displaystyle 2n$ students $\displaystyle (n \geq 5)$ participated at table tennis contest, which took $\displaystyle 4$ days. In every day, every student played a match. (It is possible that the same pair meets twice 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

See also

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2006_Romanian_NMO_Problems/Grade_9/Problem_4&oldid=8635"