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

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

14 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

91.lean

Retained formal statement1 of 14

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.

FormalConjectures/ErdosProblems/91.leanErdos91.erdos_911 lineExact file
(∀ᶠ (n : ℕ) in Filter.atTop, ¬Erdos91.UniqueMinimizer n) ↔ True
OpenStatement only, no proof

Search problems.science

Find a Problem, Result, source, or page