Erdős Problem #858

Full solution by Przemek Chojecki with GPT-5.4 Pro (15 Apr 2026).

Problem
Erdős problem #858 (number theory, primitive sets); current status: solved
Credit
Przemek Chojecki with GPT-5.4 Pro · AI working with humans
Checked
Listed in Tao's wiki
Timeline
First AI contribution 2026-04-15 · 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

Let A⊆{1,…,N}A\subseteq \{1,\ldots,N\} be such that there is no solution to at=bat=b with a,b∈Aa,b\in A and the smallest prime factor of tt is >a>a. Estimate the maximum of

1log⁡N∑n∈A1n.\frac{1}{\log N}\sum_{n\in A}\frac{1}{n}.

Statement quoted from erdosproblems.com/858, maintained by Thomas Bloom. Original source: [Er70,p.128]. Current status there: solved.

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
15 Apr, 2026 AI working with humans GPT-5.4 Pro Przemek Chojecki 🟢 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.

∎