{"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","summary":"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…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["Claude Opus"],"discussed":0,"published":"2026-11-18","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"none"}