On Goldbach's problem: proof that almost all even positive integers are sums of two primes
Source: github.com/sthubbar/goldbach-lean/tree/0e201f43acf714d7821d…
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…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-16-000013
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-16-000013/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-16-000013/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'