The board / number theory / #1122
Erdős Problem #1122
OPENdatabase updated 2025-12-30
No proof or disproof is known, and it isn't known whether a finite computation could settle it.
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 (i.e. \(f(ab)=f(a)+f(b)\) whenever \((a,b)=1\)). Let \[A=\{ n \geq 1: f(n+1)< f(n)\}.\] If \(\lvert A\cap [1,X]\rvert =o(X)\) then must \(f(n)=c\log n\) for some \(c\in \mathbb{R}\)? The condition \(\lvert A\cap [1,X]\rvert =o(X)\) says that \(A\) has natural density \(0\). Partial progress was made by Mangerel [Ma22], who proved that this is true for completely additive \(f\) if \[\lvert A\cap [1,X]\rvert \ll \frac{X}{(\log X)^{2+c}}\] for some \(c>0\), and if \(f(p)\) does not have very large values (in a certain technical sense). See also `erdos_491`.
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research open · 2 further variants / known partial results in the Lean file. The authoritative wording is on erdosproblems.com/1122.Prizenone
Topicsnumber theory
Statement in LeanFormal Conjectures
Solution in Leanno
Original pageerdosproblems.com/1122
Attempts
submit one →Read our working report →
Certified sharp finite prefix bounds and an ordinary-additive extension of Mangerel's sparse-descent theorem; #1122 remains open at the average-gap and large-prime-spike barriers.
PARTIAL