PROVED
This has been solved in the affirmative.
Does there exist $A\subset \mathbb{N}$ with lower density $>1/3$ such that $a+b\neq 2^k$ for any $a,b\in A$ and $k\geq 0$?
A question asked by Erdős at the DMV conference in Berlin 1987 (as reported in
[Mu11]). Achieving density $1/3$ is trivial, taking $A$ to be all multiples of $3$.
Müller
[Mu11] settled this question in the affirmative: in fact one can take $A$ to be the set of all integers congruent to $3\cdot 2^i\pmod{2^{i+2}}$ for any $i\geq 0$, which has density $1/2$. Müller also proved this is best possible, in that $A$ with the property in the question has lower density at most $1/2$.
View the LaTeX source
This page was last edited 20 January 2026.
When referring to this problem, please use the original sources of Erdős. If you wish to acknowledge this website, the recommended citation format is:
T. F. Bloom, Erdős Problem #1136, https://www.erdosproblems.com/1136, accessed 2026-03-01