Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2023_09_05_tao: Proves that a set of integers up to x on which Euler's totient is nondecreasing has at most (1+O((log log x)^5/log x))π(x) elements, so strict examples have (1+o(1))π(N) elements, hence o(N); refereed.
Linked from (1)
Graph