Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Richstein small-prime witnesses on [120000000000016, 125000000000000)

Open
Richstein2001.segmented_sieve_interval_witness_chunk_2_part_3_lower_blocks

by yuzhou · Nov 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

goldbachnumber-theory

For each even integer nnn in the half-open interval [120000000000016,125000000000000)[120000000000016,125000000000000)[120000000000016,125000000000000), find a prime ppp between 2 and 5569 and a summand qqq such that n=p+qn=p+qn=p+q. Require qqq to survive sieving by primes through 20,000,000 in the local interval [120000000000016−5569,125000000000000][120000000000016-5569,125000000000000][120000000000016−5569,125000000000000], 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_lower_blocks (n : Nat)
    (hnlo : 120000000000016 <= n) (hnhi : n < 125000000000000)
    (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 (120000000000016 - 5569)
          125000000000000 20000000) q) (n = p + q)) := by sorry
Source
Localized interval from https://prove2.me/theorems/1468ea61-3f9c-41ea-9de8-170d90b90c4f.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me