Erdős Problem #10 — Every integer as a prime plus at most powers of 2
One could ask the following (probably unattackable) problem. Is it true that there is an so that every integer is the sum of a prime and or fewer powers of 2.
References
P. Erdős, Some of my favourite problems in number theory, combinatorics, and geometry, Resenhas IME-USP 2 (1995), 165-186.
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.