MathDB

n points on a unit circle

Source:

November 11, 2005

combinatorics unsolvedcombinatorics

Problem Statement

Given any

n

points on a unit circle show that at most

\frac{n^2}{3}

of the segments joining two points have length

> \sqrt{2}

.

Back to Problems View on AoPS