VibeMathedMath problems solved with AI

Convergence of the Flint Hills series

The Flint Hills series is ∑n≥11n3sin⁡2n\sum_{n\ge1}\frac{1}{n^3\sin^2 n}, with nn in radians. Its terms are large exactly when nn is very close to a multiple of π\pi, so convergence depends on how well π\pi is approximated by rationals. Alekseyev (2011) showed convergence would force μ(π)≤5/2\mu(\pi)\le5/2, and Meiburg (2022) showed μ(π)<5/2\mu(\pi)<5/2 suffices, while the best known bound was about 7.17.1. Does the Flint Hills series converge?

Result
Proved(see note)
Status
Candidate (review pending)
AI contribution
AI-discovered
Method
Argument
Field
Diophantine approximation; series
Posed by
Popularized by Clifford Pickover (per the manuscript); studied by Max Alekseyev, On convergence of the Flint Hills series, arXiv:1104.5100 (2011)
Year posed
—
Years open
—
Solved
2026-09-24
Model
Unreleased internal OpenAI model
Vendor
OpenAI
Collaborators
—
Verification
Unreviewed
Publication
Announced
Collection
OpenAI math release (October 2026), version adc7f12
Significance
35 / 100
Disclosed cost
—
Wikipedia
No dedicated article

What was actually shown

Corollary 1.2: ∑n≥11/(n3sin⁡2n)\sum_{n\ge1}1/(n^3\sin^2 n) converges, deduced from μ(π)=2\mu(\pi)=2 via a dyadic spacing estimate valid for any exponent below 5/25/2. More generally ∑n−a∣sin⁡n∣−b\sum n^{-a}|\sin n|^{-b} converges iff a>max⁡{1,b}a>\max\{1,b\} (Corollary 5.2). No value or numerical estimate of the sum is given.

What the AI did

The release README says the vast majority of its results were produced by one fixed procedure with an unreleased internal OpenAI model, using on average about three hours of ChatGPT Pro thinking compute per result, out of roughly 4,000 problems posed; the output was aggregated into result families and manuscripts and kept if judged significant enough. This family has one manuscript, dated September 24, 2026; the series result is a corollary of its main theorem on the irrationality exponent of pi. The manuscript is credited to 'OpenAI' alone and names no human author. The README's two exceptions to the fixed procedure (the Riemann zeta zero-free region work, whose Re(s) > 11/12 write-up was human-edited, and the Hodge conjecture for CM abelian varieties) do not concern this family, so the result is presented as found and written up by the model. The README also cautions that unformalized results could have issues. OpenAI also released an abridged reasoning summary for this family (reasoning_traces/irrationality-exponent-of-pi.pdf).

Verification

No independent mathematician has checked this yet. Checked here: Corollary 1.2 and Section 5 of the TeX source read against the question; convergence follows from μ(π)<5/2\mu(\pi)<5/2 by a short dyadic spacing lemma that the paper proves (Meiburg's criterion is cited too). Everything rests on the unrefereed main theorem μ(π)=2\mu(\pi)=2. The release's Lean scope note says the Flint Hills consequence is outside the Comparator challenge PiExponent. The solution module OAI.NumberTheory.PiExponent.Main also contains a theorem flint_hills_summable stating summability of 1/(n3sin⁡2n)1/(n^3\sin^2 n), but it is not a Comparator challenge, so it is not counted here; nothing was rebuilt.

Sources

Changelog1 change

Discussion