Explicit thresholds for Chen’s theorem under GRH
Chen’s theorem says that every sufficiently large even integer is a prime plus an integer with at most two prime factors. An explicit threshold tells us how large an even integer must be. One line of work uses the Generalized Riemann Hypothesis, which gives sharper estimates for primes in arithmetic progressions.
Why it matters and what counts as progress
Why it matters: Reducing the threshold measures how much the sieve can prove with explicit constants. Its numerical value depends on how errors in the sieve are bounded.
What counts as progress: Lower the threshold for all even integers above it while stating every analytic input. A threshold using fewer or weaker hypotheses is another form of progress.
How the problem developed
Matteo Bordignon and Valeriia Starichkova Gave the explicit threshold under GRH in their preprint. Their 2024 journal Corollary 1 lowered it to .
Steve Hubbard with Claude Opus 5.5 A new choice of sieve parameters yields from GRH and the exact stated versions of four analytic inputs.
AI contribution
A lower explicit threshold for Chen’s theorem under GRH
Assume GRH and the exact fixed-level sieve and analytic premises corresponding to Bordignon and Starichkova’s Theorems 4–7. Then every even is the sum of a prime and a square-free integer greater than one with at most two prime factors.
Sources
Publication history
Daily emails by default, only when there’s an update.