Delphi.science

Primes and powers of 2: Gallagher's mean square theorem and the asymptotic count of two primes and k powers of 2

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

Steve Hubbard

Palomar Registrypalomar/PALOMAR-2026-11-15-000003Nov 15, 2026math.NTscore 0

A Lean 4 proof, with no unproved steps, of the two main theorems of P. X. Gallagher, Primes and powers of 2, Invent. Math. 29, 1975, for the base g = 2. Let r'_k of n count the representations n = p + 2^v1 + ... + 2^vk with p prime and 1 = 1 and N >= N_k, the sum over odd n = 2 and every even N >= N_k, r''_k of N differs from 2 N L^k / log^2 N by at most K times log^2 k / k times 2 N L^k / log^2 N, with an absolute constant K. Binary Goldbach is open and is not claimed. AI agents wrote the Lean code, Claude by Anthropic and Codex by OpenAI, as listed in PORTING.md, and it is offered for…

RepositoryJSONText

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-15-000003
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-15-000003/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-15-000003/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'