VibeMathedMath problems solved by AI
All problems

Erdős Problem #996

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

Let n1<n2<n_1<n_2<\cdots be a lacunary sequence of integers and fL2([0,1])f\in L^2([0,1]) with nnth Fourier partial sum fnf_n. Is there an absolute constant C>0C>0 such that if ffn2(logloglogn)C\| f-f_n\|_2 \ll (\log\log\log n)^{-C} then 1NkNf({αnk})01f\frac{1}{N}\sum_{k\leq N}f(\{\alpha n_k\})\to\int_0^1 f for almost every α\alpha? A preprint answers this negatively via a dyadic spike-block counterexample.

Result
Disproved(see note)
Status
Candidate (review pending)
AI contribution
AI-assisted
Method
Construction
Field
Analysis, Fourier Series
Posed by
Paul Erdős
Year posed
1964
Years open
62y
Solved
2026-04-21
Model
GPT-5.4 Pro
Vendor
OpenAI
Collaborators
Boon Suan Ho
Verification
Unreviewed
Publication
Preprint
Significance
10 / 100
Disclosed cost
Wikipedia
No dedicated article

What was actually shown

Answered negatively in a preprint that also settles the p=2 case of problem #995; erdosproblems.com still lists the problem open

What the AI did

Per the paper's acknowledgements, GPT-5.4 Pro was used during development to explore proof strategies, test intermediate formulations and assist with exposition; all arguments were independently verified by the author, who takes full responsibility.

Verification

An arXiv preprint with no independent review yet; erdosproblems.com still lists the problem open.

Sources

erdosproblems.com/996

Discussion