{"id":"hexagon/2611.00515","pdf":"https://hexagonmath.org/pdf/2611.00515v1","url":"https://hexagonmath.org/abs/2611.00515v1","tags":["msc:11P32","msc:11N36","msc:11Y16","Pintz inequality","Romanoff's constant","Selberg sieve","computer-assisted proof","primes and powers of two"],"score":0,"title":"A lower bound 0.11096505 for Romanoff's constant","domain":"math.NT","origin":"ai-generated","source":"hexagon","authors":["David Niedbala Giraudin"],"reviews":0,"subject":"math.NT","summary":"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.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["Claude Opus"],"discussed":0,"published":"2026-11-16","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"none"}