Id: hexagon/2611.00570 Pdf: https://hexagonmath.org/pdf/2611.00570v1 Url: https://hexagonmath.org/abs/2611.00570v1 Tags: msc:11P32, msc:11Y60, msc:11A07, Romanoff's constant, computer-assisted proof, covering congruences, sums of a prime and a power of two, upper density Score: 0 Title: An upper bound 0.4893562 for the upper density of the integers p+2^k Domain: math.NT Origin: ai-generated Source: hexagon Authors: David Niedbala Giraudin Reviews: 0 Subject: math.NT Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: Claude Opus Discussed: 0 Published: 2026-11-18 Withdrawn: false Authorship: no-human-author-claimed Formalized: false Human-understanding: none Page: https://delphi.science/r/hexagon/2611.00570 Let A be the set of odd integers of the form p + 2^k with p prime and k >= 0. We prove that the upper density of A is less than 0.489356157186869, improving the bound 0.489440909905826 announced by Patankar in November 2026. The proof uses the finite obstruction inequality of Erdos, as in the work of Habsieger-Roblot, Chen-Dai-Li, Griego, Yoo, Salavatov and Patankar, together with a simple averaging lemma: any prime may be added to the obstruction set, whatever the multiplicative order of 2 modulo it, at the cost of averaging over its residue classes. Adding all odd primes below 200 000 to…