MathDB
A_1,...,A_n points - Iran NMO 1999 (Second Round) Problem6

Source:

October 4, 2010
combinatorics proposedcombinatorics

Problem Statement

Let A1,A2,,AnA_1,A_2,\cdots,A_n be nn distinct points on the plane (n>1n>1). We consider all the segments AiAjA_iA_j where i<jni<j\leq{n} and color the midpoints of them. What's the minimum number of colored points? (In fact, if kk colored points coincide, we count them 11.)