Dual View Random Solved Random Open
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$?
Disclaimer: The open status of this problem reflects the current belief of the owner of this website. There may be literature on this problem that I am unaware of, which may partially or completely solve the stated problem. Please do your own literature search before expending significant effort on solving this problem. If you find any relevant literature not mentioned here, please add this in a comment.
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.

External data from the database - you can help update this
Formalised statement? Yes
Related OEIS sequences: A384927 A391592
Likes this problem conglu
Interested in collaborating conglu
Currently working on this problem conglu
This problem looks difficult None
This problem looks tractable None

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