MathDB
Points with irrational distance from at least one of points

Source: Canada National Mathematical Olympiad 1982 - Problem 3

September 30, 2011
trigonometrycombinatorics unsolvedcombinatorics

Problem Statement

Let Rn\mathbb{R}^n be the nn-dimensional Euclidean space. Determine the smallest number g(n)g(n) of a points of a set in Rn\mathbb{R}^n such that every point in Rn\mathbb{R}^n is an irrational distance from at least one point in that set.
Back to ProblemsView on AoPS