olymmath

CMO 1982 Problem 3

  • Paper

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.

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator ca-cmo/1982/p3 · Tag K1ZCZAP5SZ · Edit this page on GitHub · Keys: j next, k previous