MathDB
partitioning 2n points

Source: IZO 1 Junior Problem 3

December 16, 2008
rotationcombinatorics proposedcombinatorics

Problem Statement

Let A A be a set of 2n 2n points on the plane such that no three points are collinear. Prove that for any distinct two points a,bāˆˆA a,b\in A there exists a line that partitions A A into two subsets each containing n n points and such that a,b a,b lie on different sides of the line.
Back to ProblemsView on AoPS