Id: palomar/PALOMAR-2026-11-15-000003 Url: https://github.com/sthubbar/goldbach-lean/tree/9b3e99980ea682313d1da24f8ed7c8f57042578d/entries/gallagher1975 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-15-000003-v1.json Repo: https://github.com/sthubbar/goldbach-lean Tags: math.NT, msc:11P32, msc:11P55, msc:11N36, msc:11M26 Score: 0 Title: Primes and powers of 2: Gallagher's mean square theorem and the asymptotic count of two primes and k powers of 2 Trust: high Domain: math.NT Source: palomar Authors: Steve Hubbard Reviews: 0 Subject: math.NT Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-15 Formalized: true Formalizes: title=Primes and powers of 2 identifier=doi:10.1007/BF01390190 relationship=formalizes Formalizes: title=The exceptional set in Goldbach's problem identifier=Acta Arithmetica 27, 1975, pages 353-370 relationship=adapts Formalizes: title=Hilbert's inequality identifier=Journal of the London Mathematical Society 8, 1974, pages 73-82 relationship=adapts Page: https://delphi.science/r/palomar/PALOMAR-2026-11-15-000003 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…