MathDB
Non-intersecting convex envelops

Source: Sharygin Geometry Olympiad 2012 - Problem 24

April 28, 2012
combinatorial geometrygeometry unsolvedgeometry

Problem Statement

Given are nn (n>2)(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?
Back to ProblemsView on AoPS