Erdős Problem #10 — Every integer as a prime plus at most $r$ powers of 2

Erdős

One could ask the following (probably unattackable) problem. Is it true that there is an $r$ so that every integer is the sum of a prime and $r$ or fewer powers of 2.

Sources & referencesView supporting material

Primary source

P. Erdős, Some of my favourite problems in number theory, combinatorics, and geometry, Resenhas IME-USP 2 (1995), 165-186.

additive-basis erdos-problem number-theory primes

3 weeks ago

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.

Sign in to submit a solution.

No solutions have been posted yet.