November 5–November 12, 2010
Problem
Consider a set of 2n points in the plane, no three of them
lying in the same line, with n of them colored purple and
n colored gold.
A "husky matching" for these points is a pairing of points in which
n pairs of points are formed, each consisting of one purple point
and one gold point, and no point is used twice so that all points are
used.
Show that there exists a husky matching such that, if a line is drawn
between the two points for each pair, no two lines intersect.
Solution
List of solvers
Gourab Ray, Jonathan Cross, Crispin Pereira, Peiyush Jain.
Crispin Pereira wins the prize!