VibeMathedMath problems solved with AI

Erdős Problem #320

Erdős problem #320 · erdosproblems.com/320

Let S(N)S(N) count the distinct values of nA1/n\sum_{n\in A} 1/n over A{1,,N}A\subseteq\{1,\dots,N\}. Estimate S(N)S(N).

Result
Proved
Status
Resolved
AI contribution
AI-discovered
Method
Argument
Field
Number Theory, Unit Fractions
Posed by
Paul Erdős, Ronald Graham
Year posed
1980
Years open
46y
Solved
2026-07
Model
GPT-5.6 Sol
Vendor
OpenAI
Collaborators
Young, Zhu, Luo
Verification
Site-confirmed
Publication
Announced
Significance
10 / 100
Disclosed cost
Wikipedia
No dedicated article

What the AI did

GPT-5.6 Sol (prompted by Young, Zhu, and Luo) proved a matching upper bound, pinning logS(N)\log S(N) to order NlogNj3logjN\frac{N}{\log N}\prod_{j\ge 3}\log_j N.

Verification

Marked solved on erdosproblems.com via a proof claim; not formally Lean-verified.

Source

Changelog1 change
  • Curatoradded this entry

Discussion