Erdős Problem #1004

Partial progress by GPT-5.5 Pro (29 Apr 2026): partial result (implicit in literature).

Problem
Erdős problem #1004 (number theory); current status: open
Credit
GPT-5.5 Pro · AI building on known literature
Checked
Listed in Tao's wiki
Timeline
First AI contribution 2026-04-29 · 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

Let c>0c>0. If xx is sufficiently large then does there exist n≤xn\leq x such that the values of ϕ(n+k)\phi(n+k) are all distinct for 1≤k≤(log⁡x)c1\leq k\leq (\log x)^c, where ϕ\phi is the Euler totient function?

Statement quoted from erdosproblems.com/1004, maintained by Thomas Bloom. Original source: [Er85e]. 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 Outcome Literature
29 Apr, 2026 AI building on known literature GPT-5.5 Pro 🟡 Partial result (implicit in literature) 🟡 Pollack, Pomerance, and Treviño (2013)

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.

∎