Problem #2

Given n distinct points in the plane, no three of which are collinear, what is the smallest number of line segments that must be drawn between them to guarantee that if any four points are chosen, three of them will form the vertices of a triangle having these segments as sides?

Source: a problem proposed, but not used, for the IMO

The solution will be posted shortly.

Back to the Archives

Back to the Math Department Homepage.