Erdős Problem #897

Archivara and Aristotle produced a solution (26 Dec 2025), but a comparable result was already in the literature: Wirsing (1981).

Problem
Erdős problem #897 (number theory); current status: disproved (Lean)
Credit
Archivara and Aristotle · AI on its own; related literature found afterwards
Checked
Lean formalizationListed in Tao's wiki
Timeline
First AI contribution 2025-12-26 · wiki data as of 2026-06-30
Sources
Problem page (erdosproblems.com)Tao's AI-contributions wiki
PRIOR
ART
Per Tao's AI-contributions wiki

The problem

Let f(n)f(n) be an additive function (so that f(ab)=f(a)+f(b)f(ab)=f(a)+f(b) if (a,b)=1(a,b)=1) such that

lim sup⁡p,kf(pk)log⁡pk=∞.\limsup_{p,k}\frac{f(p^k)}{\log p^k}=\infty.

Is it true that

lim sup⁡nf(n+1)−f(n)log⁡n=∞?\limsup_n \frac{f(n+1)-f(n)}{\log n}=\infty?

Or perhaps even

lim sup⁡nf(n+1)f(n)=∞?\limsup_n \frac{f(n+1)}{f(n)}=\infty?

Statement quoted from erdosproblems.com/897, maintained by Thomas Bloom. Original source: [Er72,p.85]. Current status there: disproved (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
26 Dec, 2025 AI on its own; related literature found afterwards Archivara, Aristotle 🟢 Full solution (Lean) 🟢 Wirsing (1981)

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.

∎