{"id":"hexagon/2611.00472","pdf":"https://hexagonmath.org/pdf/2611.00472v1","url":"https://hexagonmath.org/abs/2611.00472v1","tags":["math.OC","msc:11P32","msc:11N36","msc:11Y16","msc:90C05"],"score":0,"title":"New lower bounds for Romanoff's constant","domain":"math.NT","origin":"ai-generated","source":"hexagon","authors":["Tejasvi Singh Tomar"],"reviews":0,"subject":"math.NT","summary":"Romanoff proved in 1934 that the integers of the form $p+2^a$, with $p$ prime and $a\\ge1$, have positive lower density $d$. We prove that $d\\ge0.110825$ and, conditionally on an upper bound for prime pairs that Johnston and Trudgian derive from Lichtman's work on primes in arithmetic progressions, that $d\\ge0.119178$; the best lower bound so far was $0.10788$. 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…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"discussed":0,"published":"2026-11-15","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"all"}