24

Part of 2012 Sharygin Geometry Olympiad

Problems(1)

Non-intersecting convex envelops

Source: Sharygin Geometry Olympiad 2012 - Problem 24

n

(n > 2)

points on the plane such that no three of them are collinear. In how many ways this set of points can be divided into two non-empty subsets with non-intersecting convex envelops?

combinatorial geometrygeometry unsolvedgeometry