Richstein small-prime witnesses on [125000000000000, 130000000000000)
OpenRichstein2001.segmented_sieve_interval_witness_chunk_2_part_3_upper_blocksgoldbachnumber-theory
For each even integer in the half-open interval , find a prime between 2 and 5569 and a summand such that . Require to survive sieving by primes through 20,000,000 in the local interval , with sieving primes themselves retained.
Preamble
import Definitions.Def_GoldbachSieve import Mathlib.Algebra.Ring.Parity
Formal statement
theorem Richstein2001.segmented_sieve_interval_witness_chunk_2_part_3_upper_blocks (n : Nat)
(hnlo : 125000000000000 <= n) (hnhi : n < 130000000000000)
(hnEven : Even n) :
Exists fun p => And (Membership.mem ((Finset.Icc 2 5569).filter Nat.Prime) p)
(Exists fun q => And
(Membership.mem (GoldbachSieve.survivors (125000000000000 - 5569)
130000000000000 20000000) q) (n = p + q)) := by sorrySource
Localized interval from https://prove2.me/theorems/1468ea61-3f9c-41ea-9de8-170d90b90c4f.