OPEN
This is open, and cannot be resolved with a finite computation.
What is the size of the largest $A\subseteq \{1,\ldots,N\}$ such that all sums $\sum_{n\in S}\frac{1}{n}$ are distinct for $S\subseteq A$?
Let $R(N)$ be the maximal such size. Results of Bleicher and Erdős from
[BlEr75] and
[BlEr76b] imply that\[\frac{N}{\log N}\prod_{i=3}^k\log_iN\leq R(N)\leq \frac{1}{\log 2}\log_r N\left(\frac{N}{\log N} \prod_{i=3}^r \log_iN\right),\]valid for any $k\geq 4$ with $\log_kN\geq k$ and any $r\geq 1$ with $\log_{2r}N\geq 1$. (In these bounds $\log_in$ denotes the $i$-fold iterated logarithm.)
See also
[320].
View the LaTeX source
This page was last edited 28 September 2025.
Additional thanks to: Boris Alexeev, Zachary Hunter, and Dustin Mixon
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 #321, https://www.erdosproblems.com/321, accessed 2026-01-16