Partition the points Given an even number of points in general positions on the plane (that is, no three points co-linear), can you partition the points into pairs and connect the two points of each pair with a single straight line such that the straight lines do not overlap?
 A: Suppose the result is true for $2n$ points. We show it is true for $2(n+1)$ points.
Let $S$ be a set of $2(n+1)$ points. Draw a straight line $\ell$ such that all points of $S$ are on one side of the line, and none is on the line.
Move the line $\ell$ parallel to itself, slowly towards $S$. After a while, it just meets $S$, say at point $P$. If it also meets $S$ at another point $Q$, be happy. Else rotate the line slowly about $P$ until it first meets $S$ at another point $Q$.
Join $PQ$ by a line segment. By the induction hypothesis, the rest of the points of $S$ can be split into pairs, and the pairs joined by non-intersecting line segments. By the choice of $P$ and $Q$, these line segments do not meet $PQ$.
Remark: In fewer words, the convex hull of $S$ is a polygon. We can let $P$ and $Q$ be any two consecutive vertices of the polygon.
A: Yes. There are a finite number of ways to partition the points into pairs. Choose a partition which minimizes the sum of the squares of the lengths of the resulting line segments. If two of the segments intersect, it's clear from the parallelogram law that the sum could be made smaller. ("General position" is irrelevant for this; all you need is an even number of distinct points in the plane.)
