Vela

Let be such that every large integer can be written as for some and . What is the smallest possible value ofIs

Open — best to date is a partial proof, not yet sealed.

number theory · open · formalized (Lean) · 1 attempt

machinery: additive-basis,additive-complement-of-squares,additive-combinatorics,extremal-density-constant,limsup-liminf-asymptotic-density,prime-distribution

use this record

vela registry pull vfr_37aec80d874a0239
vela reproduce examples/erdos-problems

evidence

partial proof

needs verification

Erdős 33 (smallest limsup |A∩[1,N]|/√N for additive complements of squares) is open; exact value unknown. I confirmed the record sandwich inf ∈ [4/π, 2φ^{5/2}]≈[1.273, 6.660], gave a clean self-contai

Erdős 33 (smallest limsup |A∩[1,N]|/√N for additive complements of squares) is open; exact value unknown. I confirmed the record sandwich inf ∈ [4/π, 2φ^{5/2}]≈[1.273, 6.660], gave a clean self-contained proof that L(W) ≥ 4/π holds for the LIMSUP of every complement (Riemann-sum argument, π/4 constant machine-verified), and argued the 2025 "no exact-on-average" excess (≫√N(log N)^δ) is o(N) so cannot lift the lower constant above 4/π. Computationally: finite/horizon-greedy "complements" are invalid (explicit failure at k=3,003,287); valid greedy and naive constructions cannot beat van Doorn's 6.66. No new record; honest partial.

unverified AI candidates (2)

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

Let [ A(N):=\bigl|A\cap{1,\dots,N}\bigr|. ] Your hypothesis says that $A$ is an **additive complement of the squares**: for all sufficiently large $m$ there exist (n\ge 0) and (a\in A) with (m=n^2+a). ([Erdős Problems][1])

candidate solution ↗

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

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

candidate solution ↗

formal

AMS 11 · open (literature)

theorem erdos_33 : ⨅ A : {A : Set ℕ | AdditiveBasisCondition A}, Filter.atTop.limsup (fun N =>
    (A.1 ∩ Icc 1 N).ncard / (√N : EReal)) = answer(sorry)
formal-conjectures/33.lean ↗

status

open

notary

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

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.