arXiv · 2309.02325
Monotone non-decreasing sequences of the Euler totient function
Abstract
Let $M(x)$ denote the largest cardinality of a subset of $\{n \in \mathbf{N}: n \leq x\}$ on which the Euler totient function $\varphi(n)$ is non-decreasing. We show that $M(x) = (1+O(\frac{(\log\log x)^5}{\log x})) \pi(x)$ for all $x \geq 10$, answering questions of Erd\H{o}s and Pollack--Pomerance--Trevi\~no. A similar result is also obtained for the sum of divisors function $\sigma(n)$.
Explore related subjects
Keep this discovery
Terence Tao. 2023-09-05. Monotone non-decreasing sequences of the Euler totient function. https://arxiv.org/abs/2309.02325
Cite the original work for its findings. Save a collection to share your selection of sources.