MathDB
A set of 2^n-1 points

Source: IMO Shortlist 1994, C7

October 22, 2005
combinatoricsIMO Shortlistcombinatorial geometryconvex polygonpolygon

Problem Statement

Let n>2 n > 2. Show that there is a set of 2nāˆ’1 2^{n-1} points in the plane, no three collinear such that no 2n 2n form a convex 2n 2n-gon.
Back to ProblemsView on AoPS