arXiv · 2505.08434
Explicit formulas for Euler's totient function and the number of divisors
Abstract
In this article, we present relations for the Euler totient function $\varphi(n)$ and the number of divisors $\tau(n)$ in terms of finite sums of integer parts of rational numbers or greatest common divisors of pairs of integers. Some of the formulas are obtained using a relation due to Menon and the connections with the Pillai arithmetic function are outlined. The reported expressions may be useful to derive new bounds for the usual arithmetical functions.
Explore related subjects
Keep this discovery
Jean-Christophe Pain. 2025-05-13. Explicit formulas for Euler's totient function and the number of divisors. https://arxiv.org/abs/2505.08434
Cite the original work for its findings. Save a collection to share your selection of sources.