MathDB
Length of segments

Source: Greek BMO TST 2015 Problem 2

April 5, 2015
combinatorics

Problem Statement

Consider 111111 distinct points which lie on or in the internal of a circle with radius 1.Prove that there are at least 19981998 segments formed by these points with length ≤3\leq \sqrt{3}
Back to ProblemsView on AoPS