Problem

Source: Bulgaria 1972 P4

Tags: geometry, combinatorics, combinatorial geometry



Find maximal possible number of points lying on or inside a circle with radius $R$ in such a way that the distance between every two points is greater than $R\sqrt2$. H. Lesov