SHARYGIN 2012 Problem 24
Given are 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?
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.