Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1945_02_24_erdos: Proves that an additive function that is nondecreasing, or whose consecutive differences tend to zero, is exactly a constant multiple of the logarithm; refereed in the Annals of Mathematics.
1970_01_01_wirsing: Proves that an additive function whose consecutive differences are bounded equals a constant multiple of the logarithm up to a bounded error, answering the question yes; published in Symposia Mathematica and recorded as the proof.
Linked from (1)
Graph