Skip to content

Erdős problem 503

What is the size of the largest A⊆RnA \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 ∣x−y∣|x - y|, ∣y−z∣|y - z|, ∣x−z∣|x - z| are equal.

Sources

The source's own material, retained exactly.

5 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

503.lean

Retained formal statement1 of 5

What is the size of the largest A⊆RnA \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 ∣x−y∣|x - y|, ∣y−z∣|y - z|, ∣x−z∣|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