Delphi.science

Goldbach numbers in short intervals of length x^(26/1075+ε)

Source: github.com/sthubbar/goldbach-lean/tree/d0d978d2cf565be71d69…

Steve Hubbard

Palomar Registrypalomar/PALOMAR-2026-11-03-000025Nov 3, 2026math.NTscore 0

A Lean 4 proof that for every ε > 0 and all large natural x there is a Goldbach number, an even sum of two primes, in the interval from x to x + 3 x^(26/1075+ε). The theorem is conditional on two cited results taken as explicit hypotheses, never as axioms, and neither is proved here: LiRow052, R. Li, arXiv 2308.04458, Theorem 2, the row θ = 0.52, primes in the intervals from n - n^(0.52+ε) to n with a lower bound of the right order, with some positive constant since the printed constant differs between versions of the paper; and LiPrintedExceptionalCount, R. Li, arXiv 2407.05651 v6, Theorem…

RepositoryJSON

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-03-000025
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-03-000025/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-03-000025/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'