Erdős Problem #768

A claim by Eric Li with GPT (22 Jun 2026) that has not yet been verified: candidate full solution.

Problem
Erdős problem #768 (number theory); current status: open
Credit
Eric Li with GPT · AI working with humans
Checked
Listed in Tao's wiki
Timeline
First AI contribution 2026-06-22 · wiki data as of 2026-06-30
Sources
Problem page (erdosproblems.com)Tao's AI-contributions wiki
UN-
VERIFIED
Per Tao's AI-contributions wiki

The problem

Let A⊂NA\subset\mathbb{N} be the set of nn such that for every prime p∣np\mid n there exists some d∣nd\mid n with d>1d>1 such that d≡1(modp)d\equiv 1\pmod{p}. Is it true that there exists some constant c>0c>0 such that for all large NN

∣A∩[1,N]∣N=exp⁡(−(c+o(1))log⁡Nlog⁡log⁡N).\frac{\lvert A\cap [1,N]\rvert}{N}=\exp(-(c+o(1))\sqrt{\log N}\log\log N).

Statement quoted from erdosproblems.com/768, maintained by Thomas Bloom. Original source: [Er74b]. 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
22 Jun, 2026 AI working with humans GPT Eric Li ⚪ Candidate full solution

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.

∎