Checking the odd Goldbach conjecture up to 10^20
A Lean 4 formalization of the mathematics of Y. Saouter, Checking the odd Goldbach conjecture up to 10^20, Math. Comp. 67, 1998, 863 to 866. Proved with no hypothesis: Lemma 1, the paper's form of Theorem 5 of Brillhart, Lehmer and Selfridge 1975, for every even F; Theorem 1, the primality criterion for N = 2^22 R + 1 below 10^20 with R odd and any base a with a^((N-1)/2) = -1 modulo N; Lemma 2 by quadratic reciprocity; Theorem 2, the case of base 5; the primality of the 100 rungs of Table 1 and of the first and last primes printed in the paper. The printed ladder constant 1258213 is a…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-02-000012
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-02-000012/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-02-000012/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'