Erdős Problem #321 — Distinct subset sums of reciprocals
What is the size of the largest such that all sums are distinct for ?
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
An AI-generated matching estimate has been reported, but it has not been checked, so the problem remains open.
Erdős Problem asks for the growth of , the largest subset of whose reciprocal subset sums are all distinct.
Known results
- Bleicher and Erdős (, ): iterated-logarithmic lower and upper bounds for .
- Bettin, Grenié, Molteni, and Sanna (): the currently recorded lower-bound scale.
- Certified computation reaches , with .
July 2026 order-of-magnitude claim
The Erdős Problems page attributes a matching upper bound to GPT 5.6 Sol, prompted by Young, Zhu, and Luo, yielding the claimed estimate . No independently checkable proof was found,.
Current status (as of September 2026): classical bounds and computation are established, but the claimed matching asymptotic remains unverified and the exact problem is open.
Solutions 0
No solutions have been posted yet.