Problem #10


A configuration of points in the plane has the property that it contains seven points that are the vertices of a convex heptagon and that for any set of five points that are the vertices of a convex pentagon there must be a point of the configuration which is in the interior of the pentagon. What is the smallest number of points that can be in such a configuration?

Source: Chinese Mathematical Olympiad

No correct solutions have been submitted, to date.

Back to the Archives


Back to the Math Department Homepage.