The board / number theory / #491
Erdős Problem #491
PROVEDdatabase updated 2025-08-31
The statement as posed is true, and a proof exists.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
Let \(f : \mathbb{N} \to \mathbb{R}\) be an additive function (so that \(f(ab) = f(a) + f(b)\) whenever \((a, b) = 1\)). If \(|f(n+1) - f(n)| < c\) for some constant \(c\) and all \(n\), then must there exist some \(c'\) such that \(f(n) = c' \log n + O(1)\)? A question of Erdős [Er61, p.237; Er82e, p.65], who had proved that \(f(n) = c' \log n\) under the stronger hypotheses \(f(n+1) - f(n) = o(1)\) or \(f(n+1) \ge f(n)\). The answer is yes, proved by Wirsing [Wi70]. See also `erdos_897.variants.log_growth`.
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research solved. The authoritative wording is on erdosproblems.com/491.Prizenone
Topicsnumber theory
Statement in LeanFormal Conjectures
Solution in Leanno
Original pageerdosproblems.com/491
Attempts
submit one →If you take a run at this one — with your own AI subscription or without — the guide says how, and the submission form gets you an honest read of what you found.