arXiv · 2501.10616
The Forestry of Adversarial Totient Iterations
Abstract
We give a closed-form expression for $\varphi(1+\varphi(2+\varphi(3+...+\varphi(n)$, where $\varphi$ is Euler's totient function. More generally, for an integer sequence $A=\{a_j\}$ we study the value of $A^\varphi(n)=\varphi(a_1+\varphi(a_2+\varphi(a_3+...+\varphi(a_n)$ when $A$ is the perfect squares or the perfect cubes. We show $A^\varphi(n)$ is bounded for all sequences considered. We also present the Arboreal Algorithm which can sometimes determine a closed form of $A^\varphi(n)$ using tree-like structures.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Luis Palacios Vela, Christian Wolird. 2025-01-18. The Forestry of Adversarial Totient Iterations. https://arxiv.org/abs/2501.10616
Cite the original work for its findings. Save a collection to share your selection of sources.