Skip to content

Erdős problem 503

What is the size of the largest ARnA \subseteq \mathbb{R}^n such that every three points from AA determine an isosceles triangle? That is, for any three points xx, yy, zz from AA, at least two of the distances xy|x - y|, yz|y - z|, xz|x - z| are equal.

Sources

Browse retained paths and inspect the exact material available for this Problem.

5 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

503.lean

Retained formal statement1 of 5

What is the size of the largest ARnA \subseteq \mathbb{R}^n such that every three points from AA determine an isosceles triangle? That is, for any three points xx, yy, zz from AA, at least two of the distances xy|x - y|, yz|y - z|, xz|x - z| are equal.

FormalConjectures/ErdosProblems/503.leanErdos503.erdos_5031 lineExact file
∀ (n : ℕ), IsGreatest {x | ∃ A, ∃ (_ : A.IsIsosceles), A.ncard = x} sorry
OpenStatement only, no proof

Search problems.science

Find a Problem, Result, source, or page