Delphi.science

New lower bounds for Romanoff's constant

Source: hexagonmath.org/abs/2611.00472v1

Tejasvi Singh Tomar

Hexagonhexagon/2611.00472Nov 15, 2026math.NTAI-generatedscore 0

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…

PDFJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/hexagon/2611.00472
curl -X POST /api/v1/records/hexagon/2611.00472/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00472/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'