OPEN
This is open, and cannot be resolved with a finite computation.
Find the best function $f(n)$ such that every $n$ can be written as $n=a+b$ where both $a,b$ are $f(n)$-smooth (that is, are not divisible by any prime $p>f(n)$.)
Erdős originally asked if even $f(n)\leq n^{1/3}$ is true. This is known, and the best bound is due to Balog
[Ba89] who proved that\[f(n) \ll_\epsilon n^{\frac{4}{9\sqrt{e}}+\epsilon}\]for all $\epsilon>0$. (Note $\frac{4}{9\sqrt{e}}=0.2695\ldots$.)
It is likely that $f(n)\leq n^{o(1)}$, or even $f(n)\leq e^{O(\sqrt{\log n})}$.
See also
Problem 59 on Green's open problems list.
View the LaTeX source
Additional thanks to: Zachary Hunter and Desmond Weisenberg
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 #334, https://www.erdosproblems.com/334, accessed 2026-01-16