MathDB
P36 [Combinatorics] - Turkish NMO 1st Round - 2005

Source:

November 10, 2013

Problem Statement

nn wrestlers participate in a tournament such that any two wrestlers wrestle exactly once. After a match, the winner gets 22 points, the loser gets no point, and each wrestlers gets 11 point if a tie occurs. After the tournament finishes, the wrestler with highest points is the wrestler with lowest number of wins. What is the least value of nn?
<spanclass=latexbold>(A)</span> 5<spanclass=latexbold>(B)</span> 6<spanclass=latexbold>(C)</span> 7<spanclass=latexbold>(D)</span> 8<spanclass=latexbold>(E)</span> 9 <span class='latex-bold'>(A)</span>\ 5 \qquad<span class='latex-bold'>(B)</span>\ 6 \qquad<span class='latex-bold'>(C)</span>\ 7 \qquad<span class='latex-bold'>(D)</span>\ 8 \qquad<span class='latex-bold'>(E)</span>\ 9