Erdős Problem #997

Full solution by OpenAI internal model (31 Mar 2026).

Problem
Erdős problem #997 (analysis, discrepancy, primes); current status: proved (Lean)
Credit
OpenAI internal model · AI on its own; related literature found afterwards
Checked
Listed in Tao's wiki
Timeline
First AI contribution 2026-03-31 · wiki data as of 2026-06-30
Sources
Problem page (erdosproblems.com)Tao's AI-contributions wiki
SOLVEDPer Tao's AI-contributions wiki

The problem

Call x1,x2,…∈(0,1)x_1,x_2,\ldots \in (0,1) well-distributed if, for every ϵ>0\epsilon>0, if kk is sufficiently large then, for all n>0n>0 and intervals I⊆[0,1]I\subseteq [0,1],

∣#{n<m≤n+k:xm∈I}−∣I∣k∣<ϵk.\lvert \# \{ n<m\leq n+k : x_m\in I\} - \lvert I\rvert k\rvert < \epsilon k.

Is it true that, for every α\alpha, the sequence {αpn}\{ \alpha p_n\} is not well-distributed, if pnp_n is the sequence of primes?

Statement quoted from erdosproblems.com/997, maintained by Thomas Bloom. Original source: [Er64b]. Current status there: proved (Lean).

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 Outcome Literature
31 Mar, 2026 AI on its own; related literature found afterwards OpenAI internal model 🟢 Full solution 🟡 Benatar (2014)

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.

∎