Skip to content

Erdős problem 959

How large can the difference between the largest and second-largest distance multiplicities be among nn planar points?

No current result

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

Retained declaration

FormalConjectures/ErdosProblems/959.lean

Formal Conjectures

FormalConjectures/ErdosProblems/959.leanErdos959.erdos_9591 lineExact file
True ↔ ∃ γ, Filter.Tendsto (fun n => Real.log ↑(Erdos959.extremalGap n) / Real.log ↑n) Filter.atTop (nhds γ)
OpenStatement only, no proof

Proof manifests naming this Problem

  • William Blair Lean proofswilliamjblair:Erdos959.erdos959_superlinear_lower_bound

Reported activity

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

  • argument

    VibeMathed

    Machine
    GPT-5.6 starships (Claude Fable 5 reviewer)
    Reported outcome
    partial
    Open the source record

Continue

Start a contributionBrowse the source filesOpen the collection entry

Search problems.science

Find a Problem, Result, source, or page