Delphi.science

Proth's criterion and the prime ladder reduction for ternary Goldbach up to 8.875 · 10^30

Source: github.com/sthubbar/goldbach-lean/tree/0e201f43acf714d7821d…

Steve Hubbard

Palomar Registrypalomar/PALOMAR-2026-11-16-000012Nov 16, 2026math.NTscore 0

Lean 4 proofs, with no unproved steps, of two results from H. A. Helfgott and D. J. Platt, Numerical verification of the ternary Goldbach conjecture up to 8.875 · 10^30, Experimental Mathematics 22, 2013, arXiv:1305.3062. First, Proth's criterion of Section 2, Theorem 2.3 in existential form; the converse printed after it, for every such a, is proved as converse but not compared: a Proth number N = k 2^n + 1 with 0 < k < 2^n is prime if and only if some integer a has Jacobi symbol -1 over N and a raised to the power N - 1 over 2 is -1 mod N. Second, Theorem 4.1, every odd number from 7 to T…

RepositoryJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-16-000012
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-16-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-16-000012/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'