Erdős Problem #1038

Partial progress by catsflowers5544, jspier, Junnosuke Koizumi, Kenneth Mendoza, Nat Sothanaphan, Terence Tao and Hua Xu with AlphaEvolve, Claude Fable 5, Codex, GPT-5.2 Thinking, GPT-5.4 Thinking and GPT-5.5 (16 Dec 2025): partial result.

Problem
Erdős problem #1038 (analysis); current status: open
Credit
catsflowers5544, jspier, Junnosuke Koizumi, Kenneth Mendoza, Nat Sothanaphan, Terence Tao and Hua Xu with AlphaEvolve, Claude Fable 5, Codex, GPT-5.2 Thinking, GPT-5.4 Thinking and GPT-5.5 · AI working with humans
Checked
Listed in Tao's wiki
Timeline
First AI contribution 2025-12-16 · wiki data as of 2026-06-30
Sources
Problem page (erdosproblems.com)Tao's AI-contributions wiki
PARTIALPer Tao's AI-contributions wiki

The problem

Determine the infimum and supremum of

∣{x∈R:∣f(x)∣<1}∣\lvert \{ x\in \mathbb{R} : \lvert f(x)\rvert < 1\}\rvert

as f∈R[x]f\in \mathbb{R}[x] ranges over all non-constant monic polynomials, all of whose roots are real and in the interval [−1,1][-1,1].

Statement quoted from erdosproblems.com/1038, maintained by Thomas Bloom. Original source: [EHP58,p.131]. 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
16 Dec, 2025-10 Jun, 2026 AI working with humans AlphaEvolve, Claude Fable 5, Codex, GPT-5.2 Thinking, GPT-5.4 Thinking, GPT-5.5 catsflowers5544, jspier, Junnosuke Koizumi, Kenneth Mendoza, Nat Sothanaphan, Terence Tao, Hua Xu 🟡 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.

∎