MathDB
P19 [Combinatorics] - Turkish NMO 1st Round - 2003

Source:

May 16, 2014

Problem Statement

At least how many elements does the set which contains all of the midpoints of segments connecting 20032003 different points in a plane have?
<spanclass=latexbold>(A)</span> 2006<spanclass=latexbold>(B)</span> 4001<spanclass=latexbold>(C)</span> 4003<spanclass=latexbold>(D)</span> 4006<spanclass=latexbold>(E)</span> None of the preceeding <span class='latex-bold'>(A)</span>\ 2006 \qquad<span class='latex-bold'>(B)</span>\ 4001 \qquad<span class='latex-bold'>(C)</span>\ 4003 \qquad<span class='latex-bold'>(D)</span>\ 4006 \qquad<span class='latex-bold'>(E)</span>\ \text{None of the preceeding}