Source authenticated

Erdős Problem #321

What is the largest $A\subseteq\{1,\dots,N\}$ such that all subset sums $\sum_{n\in S}1/n$ (over $S\subseteq A$) are distinct?

Exact FrontierDelta

Prior state unknownproved

Scope and record

Occurred: Jul 1, 2026

Delta type: SOURCE CLAIM

Assumptions: VibeMathed verification: site-confirmed. Publication: announcement. AI contribution: ai-discovered. Imported under CC BY 4.0.

Canonical aliases: Erdős Problem #321 · Erdős #321 · Problem 321

Confidence: Not scored

Registry verification: site confirmed · announcement · resolved

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

Young
human · human collaborator

Zhu
human · human collaborator

Luo
human · human collaborator

GPT-5.6 Sol
model · ai model contributor · OpenAI

Lineage and corrections

This event attributed to Young

This event attributed to Zhu

This event attributed to Luo

This event attributed to GPT-5.6 Sol

Act on this frontier

Verify, challenge, or extend the result.