Skip to content

Erdős problem 91

Suppose A⊂R2A\subset \mathbb{R}^2 has ∣A∣=n\lvert A\rvert=n and minimises the number of distinct distances between points in AA. Prove that for large nn there are at least two (and probably many) such AA which are non-similar.

Sources

The source's own material, retained exactly.

14 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

91.lean

Retained formal statement6 of 14
FormalConjectures/ErdosProblems/91.leanErdos91.erdos_91.test.unitSquare_optimal1 lineExact file
Erdos91.IsOptimal Erdos91.unitSquare 4
TestStatement only, no proof