MathDB
Colour the points

Source: China TST 2003

June 29, 2006
inequalitiesreal analysiscombinatorics unsolvedcombinatorics

Problem Statement

Let SS be the set of points inside and on the boarder of a regular haxagon with side length 1. Find the least constant rr, such that there exists one way to colour all the points in SS with three colous so that the distance between any two points with same colour is less than rr.