← All problems

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

49 years old · traced to

One could ask the following (probably unattackable) problem. Is it true that there is an rr so that every integer is the sum of a prime and rr 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.

Source: 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.