MathDB
Maximum number of segments with lenghts greater than 1

Source: Danube Math Competition 2008

January 20, 2009
combinatorics proposedcombinatorics

Problem Statement

Let n≥2 n\geq 2 be a positive integer. Find the maximum number of segments with lenghts greater than 1, 1, determined by n n points which lie on a closed disc with radius 1. 1.
Back to ProblemsView on AoPS