Dual View Random Solved Random Open
SOLVED This has been resolved in some other way than a proof or disproof.
Let $f(n)$ be minimal such that $\{1,\ldots,n-1\}$ can be partitioned into $f(n)$ classes so that $n$ cannot be expressed as a sum of distinct elements from the same class. How fast does $f(n)$ grow?
Alon and Erdős [AlEr96] proved that $f(n) = n^{1/3+o(1)}$, and more precisely\[\frac{n^{1/3}}{(\log n)^{4/3}}\ll f(n) \ll \frac{n^{1/3}}{(\log n)^{1/3}}(\log\log n)^{1/3}.\]Vu [Vu07] improved the lower bound to\[f(n) \gg \frac{n^{1/3}}{\log n}.\]Conlon, Fox, and Pham [CFP21] determined the order of growth of $f(n)$ up to a multiplicative constant, proving\[f(n) \asymp \frac{n^{1/3}(n/\phi(n))}{(\log n)^{1/3}(\log\log n)^{2/3}}.\]

View the LaTeX source

External data from the database - you can help update this
Formalised statement? No (Create a formalisation here)
Related OEIS sequences: Possible
Likes this problem None
Interested in collaborating None
Currently working on this problem None
This problem looks difficult None
This problem looks tractable None

Additional thanks to: Noga Alon

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 #360, https://www.erdosproblems.com/360, accessed 2026-01-14