New lower bounds for Romanoff's constant
Version 1 / Nov 15, 2026 / CC BY 4.0
Abstract
Romanoff proved in 1934 that the integers of the form , with prime and , have positive lower density . We prove that and, conditionally on an upper bound for prime pairs that Johnston and Trudgian derive from Lichtman's work on primes in arithmetic progressions, that ; the best lower bound so far was . The proof refines the method of Elsholtz and Schlage-Puchta, which bounds the second moment of the number of representations in each residue class modulo a fixed integer. Both bounds are certified by computer and also proved in the Lean proof assistant, with the analytic inputs as hypotheses.
References
- E. Bombieri and H. Davenport, Small differences between prime numbers , Proc. Roy. Soc. Ser. A 293 (1966), 1--18.
- Y. Chen, X. Dai and H. Li, Some results on a conjecture of de Polignac about numbers of the form , arXiv:2402.06644 (2024).arXiv
- Y.-G. Chen and X.-G. Sun, On Romanoff's constant , J. Number Theory 106 (2004), 275--284.
- G. M. Del Corso, I. Del Corso, R. Dvornicich and F. Romani, On computing the density of integers of the form , Math. Comp. 89 (2020), 2365--2386.
- C. Elsholtz and J.-C. Schlage-Puchta, On Romanov's constant , Math. Z. 288 (2018), 713--724.
- P. Erdős, On integers of the form and some related problems , Summa Brasil. Math. 2 (1950), 113--123.
- The FLINT team, FLINT: Fast Library for Number Theory , https://flintlib.org.link
- L. Habsieger and X.-F. Roblot, On integers of the form , Acta Arith. 122 (2006), 45--50.
- H. Halberstam and H.-E. Richert, Sieve Methods , Academic Press, London, 1974.
- L. Habsieger and J. Sivak-Fischler, An effective version of the Bombieri--Vinogradov theorem, and applications to Chen's theorem and to sums of primes and powers of two , Arch. Math. (Basel) 95 (2010), 557--566.
Show all 22 referencesShow fewer references
- D. R. Johnston and T. Trudgian, An update on the Linnik--Goldbach problem , arXiv:2605.17825v2 (2026).arXiv
- L. de Moura and S. Ullrich, The Lean 4 theorem prover and programming language , in: Automated Deduction -- CADE 28, Lecture Notes in Comput. Sci. 12699 , Springer, 2021, 625--635.
- J. D. Lichtman, Primes in arithmetic progressions to large moduli, and Goldbach beyond the square-root barrier , arXiv:2309.08522 (2023).arXiv
- The mathlib Community, The Lean mathematical library , in: Proc. 9th ACM SIGPLAN Int. Conf. Certified Programs and Proofs (CPP 2020), 2020, 367--381.
- J. Pintz, A note on Romanov's constant , Acta Math. Hungar. 112 (2006), 1--14.
- V. R. Pratt, Every prime has a succinct certificate , SIAM J. Comput. 4 (1975), 214--220.
- D. J. Platt and T. S. Trudgian, Linnik's approximation to Goldbach's conjecture, and other problems , J. Number Theory 153 (2015), 54--62.
- F. Romani, Computations concerning primes and powers of two , Calcolo 20 (1983), 319--336.
- N. P. Romanoff, Über einige Sätze der additiven Zahlentheorie , Math. Ann. 109 (1934), 668--678.
- J. G. van der Corput, On de Polignac's conjecture , Simon Stevin 27 (1950), 99--105.
- J. Wu, Chen's double sieve, Goldbach's conjecture and the twin prime problem , Acta Arith. 114 (2004), 215--273.
- A. Yoo, An improved upper bound on Romanoff's constant , 2026, https://github.com/andrew-yoo/romanoff.link
Version history
- v1 · 13 pagesSubmitted by Tejasvi Singh TomarPublished on Zenodo: https://doi.org/10.5281/zenodo.23715954CurrentNov 15, 2026