この記事の日本語版はまだありません。英語版を表示しています。

Erdős Problem #995

Partial progress by Boon Suan Ho with GPT-5.4 Pro (21 Apr 2026): partial result.

問題
Erdős problem #995 (analysis, discrepancy); current status: open
貢献
Boon Suan Ho with GPT-5.4 Pro · AI working with humans
検証
Listed in Tao's wiki
経緯
First AI contribution 2026-04-21 · wiki data as of 2026-06-30
出典
Problem page (erdosproblems.com)Tao's AI-contributions wiki
部分的
結果
Per Tao's AI-contributions wiki

The problem

Let n1<n2<⋯n_1<n_2<\cdots be a lacunary sequence of integers and f∈L2([0,1])f\in L^2([0,1]). Estimate the growth of, for almost all α\alpha,

∑1≤k≤Nf({αnk}).\sum_{1\leq k\leq N}f(\{ \alpha n_k\}).

For example, is it true that, for almost all α\alpha,

∑1≤k≤Nf({αnk})=o(Nlog⁡log⁡N)?\sum_{1\leq k\leq N}f(\{ \alpha n_k\})=o(N\sqrt{\log\log N})?

Statement quoted from erdosproblems.com/995, maintained by Thomas Bloom. Original source: [Er64b]. Current status there: open.

AI contributions

As recorded in Terence Tao's wiki AI contributions to Erdős problems (data as of 30 Jun 2026). 🟢 full, 🟡 partial, ⚪ unverified, 🔴 incorrect.

Date Kind AI systems Humans Outcome
21 Apr, 2026 AI working with humans GPT-5.4 Pro Boon Suan Ho 🟡 Partial result

Caveats

The wiki's classifications are provisional and are not a benchmark. Many Erdős problems have never had a thorough literature review, so a result that looks new may later turn out to be known; some problems were also stated ambiguously or incorrectly. See the problem page for the full discussion.

∎