Erdős problem 91 · problems.science

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

Sources

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

14 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

91.lean

Retained formal statement8 of 14

In [Er87b] on p.171 Erdős says that there are at least two non-similar examples for $n = 8$ .

FormalConjectures/ErdosProblems/91.leanErdos91.erdos_91.variants.eight1 lineExact file

1¬Erdos91.UniqueMinimizer 8

SolvedStatement only, no proof

Sources

Search problems.science