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 statement4 of 5

When n=3n = 3, the answer is 8 (due to Croft [Cr62]).

[Cr62] Croft, H. T., 99-point and 77-point configurations in 33-space. Proc. London Math. Soc. (3) (1962), 400-424.

FormalConjectures/ErdosProblems/503.leanErdos503.erdos_503.variants.R31 lineExact file
IsGreatest {x | ∃ A, ∃ (_ : A.IsIsosceles), A.ncard = x} 8
SolvedStatement only, no proof