A prime in for
OpenWeakGoldbach.prime_in_4e18_window_1e26_to_8875e30goldbachnumber-theoryprimes
Put
For every natural number with there exists a prime with .
This is the segment of the window-covering claim beyond the reach of the short-interval bound, so it is the part that specifically requires the Helfgott–Platt prime-ladder computation up to .
Formalization Note Combined with the elementary segment (Bertrand) and the middle segment (short-interval gaps), this completes the cover of .
Preamble
import Mathlib
Formal statement
namespace WeakGoldbach
theorem prime_in_4e18_window_1e26_to_8875e30 (x : ℕ)
(hxl : 10 ^ 26 ≤ x)
(hx : x ≤ 8875694145621773516800000000000 - 4 * 10 ^ 18) :
∃ p : ℕ, x < p ∧ p < x + 4 * 10 ^ 18 ∧ Nat.Prime p := by
sorry
end WeakGoldbachSource
H. A. Helfgott and D. J. Platt, Numerical verification of the ternary Goldbach conjecture up to 8.875e30, arXiv:1305.3062v2, §4