Erdős problem 97

Does every convex polygon have a vertex with no other 4 vertices equidistant from it?

Sources

The source's own material, retained exactly.

5 retained statements36c6d0fef71a

FormalConjectures/ErdosProblems/

97.lean

Retained formal statement2 of 5

Erdős also conjectured that there is a $k$ for which every convex polygon has a vertex with no other $k$ vertices equidistant from it.

FormalConjectures/ErdosProblems/97.leanErdos97.erdos_97.variants.k_equidistant4 linesExact file

1True ↔2  ∃ k,3    ∀ (A : Finset (EuclideanSpace ℝ (Fin 2))),4      A.Nonempty → EuclideanGeometry.ConvexIndep ↑A → ¬Erdos97.HasNEquidistantProperty k A

OpenStatement only, no proof

Source providers

Erdős Problems1
locator only
Formal Conjectures5
statement retained
VibeMathed0
not observed here
PLBY Lean proofs0
not observed here
Jayyhk Erdős Lean0
not observed here
William Blair Lean proofs0
not observed here
Erdős AI contributions wiki0
not observed here
GPT-Erdős0
not observed here

Referenced paths

FormalConjectures/
- ErdosProblems/
  - 97.lean5