{"id":"hexagon/2611.00159","pdf":"https://hexagonmath.org/pdf/2611.00159v1","url":"https://hexagonmath.org/abs/2611.00159v1","tags":["msc:11P32","msc:03B35","Goldbach Conjecture","Lean 4","Proth primes","formal verification","primality criterion"],"score":0,"title":"Saouter's primality criterion in Lean, a ladder constant, and a 25 rung route to odd Goldbach up to $10^{20}$","domain":"math.NT","origin":"ai-generated","source":"hexagon","authors":["Steve Hubbard"],"reviews":0,"subject":"math.NT","summary":"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…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"discussed":0,"published":"2026-11-06","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"some"}