olymmath

USAMO 2005 Problem 5

  • Day 2

Let nn be an integer greater than 1. Suppose 2n2n points are given in the plane, no three of which are collinear. Suppose nn of the given 2n2n points are colored blue and the other nn colored red. A line in the plane is called a balancing line if it passes through one blue and one red point and, for each side of the line, the number of blue points on that side is equal to the number of red points on the same side. Prove that there exist at least two balancing lines.

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.

Add a solution

Locator usamo/2005/p5 · Tag ZKCGX5V0P2 · Edit this page on GitHub · Keys: j next, k previous