Saouter's primality criterion in Lean, a ladder constant, and a 25 rung route to odd Goldbach up to $10^{20}$
Source: hexagonmath.org/abs/2611.00159v1
This note gives Lean proofs, with no hypothesis, of the primality criterion of Saouter's paper, Lemma 1 for every even $F$, Theorems 1 and 2, and it records the reading of the constant on page 865 under which the formula agrees with the rest of the paper; separately, given the published even Goldbach computation to $4\cdot 10^{18}$ as an explicit hypothesis, a ladder of 25 Proth primes reaches $10^{20}$ in the Lean kernel. The binary Goldbach conjecture remains open and this note makes no progress on it. The ternary Goldbach theorem for all odd numbers is Helfgott's (arXiv:1312.7748), and it…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00159
curl -X POST /api/v1/records/hexagon/2611.00159/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00159/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'