arXiv
Open Access
2025
The Forestry of Adversarial Totient Iterations
Luis Palacios Vela
Christian Wolird
Abstrak
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.
Penulis (2)
L
Luis Palacios Vela
C
Christian Wolird
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2025
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓