{"id":"palomar/PALOMAR-2026-11-16-000013","url":"https://github.com/sthubbar/goldbach-lean/tree/0e201f43acf714d7821daadf5963c06d961132e8/entries/estermann1938","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-16-000013-v1.json","repo":"https://github.com/sthubbar/goldbach-lean","tags":["math.NT","msc:11P32","msc:11P55","msc:11N13"],"score":0,"title":"On Goldbach's problem: proof that almost all even positive integers are sums of two primes","trust":"high","domain":"math.NT","source":"palomar","authors":["Steve Hubbard"],"reviews":0,"subject":"math.NT","summary":"A Lean 4 proof, with no unproved steps, of the main result of T. Estermann, On Goldbach's problem: proof that almost all even positive integers are sums of two primes, Proc. London Math. Soc. series 2, volume 44, 1938, pages 307-314. Let Q of n be the number of even positive integers less than n that are not sums of two primes. The Introduction on page 307 states that, as n tends to infinity, Q of n is O of n log^-a n for every positive a; this is the compared theorem, LeanLab.Estermann1938.main. The proof is not Estermann's circle method text: it bounds Q of n by E of n plus 1, where E of X…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-16","reactions":{},"formalized":true,"formalizes":[{"title":"On Goldbach's problem: proof that almost all even positive integers are sums of two primes","identifier":"doi:10.1112/plms/s2-44.4.307","relationship":"formalizes"},{"title":"The ternary Goldbach problem","identifier":"doi:10.4171/RMI/2","relationship":"adapts"}]}