Let C consist of a regular polygon and its interior. Show that for each positive integer n, there exists a set of points S(n) in the plane such that every n points can be covered by C, but S(n) cannot be covered by C. Putnamgeometrycombinatorial geometrypolygon