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.

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/91.lean

Formal Conjectures

FormalConjectures/ErdosProblems/91.leanErdos91.erdos_911 lineExact file

1(∀ᶠ (n : ℕ) in Filter.atTop, ¬Erdos91.UniqueMinimizer n) ↔ True

OpenStatement only, no proof

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

Solved as stated, hidden constraints
GPT-Erdős
Open the source record

Continue

Start a contribution Browse the source files Open the collection entry

No current result

Reported activity

Continue

Search problems.science