Vela

Let be such that any points in , with no three on a line and no four on a circle, determine at least distinct distances. Does ?

Worked, still open.

geometry · open · possible · formalized (Lean) · 0 attempts

machinery: geometric,distinct-distances,general-position-no-3-collinear-no-4-cocyclic,incidence-geometry,asymptotic-growth-lower-bound,extremal-combinatorial-geometry

use this record

vela registry pull vfr_37aec80d874a0239
vela reproduce examples/erdos-problems

evidence

unverified AI candidates (2)

gpt-erdos · GPT-5.2 Pro + Deep Research · unverified

People usually write your function as [ D_{\text{gen}}(n)=\min{#\text{distinct distances determined by }n\text{ points in }\mathbb R^2\text{ in general position}}, ] where “general position” means **no three collinear and no four cocircular** (same as in your question). It is *not known* whether (D_{\text{gen}}(n)) is …

candidate solution ↗

llm-hunter · gpt 5.2, gpt pro 5.2 · unverified

2 LLM attack(s) recorded (gpt 5.2, gpt pro 5.2); unverified.

candidate solution ↗

formal

AMS 52 · open (literature)

theorem erdos_98 :
    answer(sorry) ↔ Tendsto (fun n : ℕ ↦ ((h n : ℝ) / (n : ℝ))) atTop atTop
formal-conjectures/98.lean ↗

status

open

notary

vela reproduce examples/erdos-problems
  • packet.json · sha256 c3bdb5b757989a92447deb78709108138501b4ad8847bc27760e325aea0c0bcb

finding.noted · reviewer:will-blair · 1 day

renders the record as of vev_d199cb2e · 1,338 events · hub

Search Vela

Jump to a section, signal, campaign, document, primitive, work path, frontier, record index, atlas, constellation, agent, capability, or full-state search.