A lower bound 0.11096505 for Romanoff's constant
Version 1 / Nov 16, 2026 / CC BY 4.0
Abstract
Let d be the lower density of the integers of the form p + 2^a with p prime and a >= 1. We prove d >= 0.11096505, unconditionally. The previous best unconditional bound is d >= 0.110825, due to Tomar. The proof is Tomar's method, with the same analytic inputs, applied to a different modulus of the same period 27720; the bound is certified in exact rational arithmetic by Tomar's checking program, with changes that only make the computation faster and that we verify against the original program.
Provenance statement
Tools used
- Anthropic
- Claude Opus
References
- Y.-G. Chen and X.-G. Sun, On Romanoff's constant , J. Number Theory 106 (2004), 275--284.
- C. Elsholtz and J.-C. Schlage-Puchta, On Romanov's constant , Math. Z. 288 (2018), 713--724.
- 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.
- D. R. Johnston and T. Trudgian, An update on the Linnik--Goldbach problem , arXiv:2605.17825v2 (2026).arXiv
- J. Pintz, A note on Romanov's constant , Acta Math. Hungar. 112 (2006), 1--14.
- N. P. Romanoff, Über einige Sätze der additiven Zahlentheorie , Math. Ann. 109 (1934), 668--678.
- T. Tao et al., Optimization constants in mathematics , constant , https://teorth.github.io/optimizationproblems/constants/45a.html.link
- T. S. Tomar, New lower bounds for Romanoff's constant , version 11 (2026), doi:10.5281/zenodo.23715955; programs at https://github.com/tejasvi/romanoff-constant, tag v11.DOI
Version history
- v1 · 3 pagesSubmitted by David Niedbala GiraudinInitial depositCurrentNov 16, 2026