Two remarks on iterates of Euler's totient function
Let \(\varphi_k\) denote the \(k\)th iterate of Euler's \(\varphi\) function. In this paper, the author determines the average values of \(\varphi_k\) and \(1/\varphi_k\). That is, he shows that for each \(k\geq 0\), one has \[ {{1}\over {x}}\sum_{n\leq x} \varphi_k (n)\sim {{3}\over {k!e^{k\gamma}\pi^2}} {{x^2}\over {(\log\log\log x)^k}} \] as \(x\to\infty\). For the proof of this result, the author uses the fact that \(\varphi(n)/\varphi_{k+1}(n)\) has normal order \(k! e^{k\gamma} (\log\log\log n)^k\), a fact established in \textit{P. Erdős, A. Granville, C. Pomerance} and \textit{C. Spiro} [Analytic Number Theory, Proc. Conf. in Honor of Paul Bateman, Boston 1990, Prog. Math. 85, 165--204 (1990; Zbl 0721.11034)]. Secondly, for prime numbers \(p\), the author studies the number of distinct prime factors of the product \(\prod_{k\geq 1} \varphi_k(p)\), showing that this number exceeds \((\log p)^{1/2-\varepsilon}\) for all primes \(p\leq x\) with \(x^{o(1)}\) exceptions. The proof of this last result is elementary.
- scientific article; zbMATH DE number 6181645
- scientific article; zbMATH DE number 1139720
- On a generalization of the Euler totient function
- On a generalization of the Euler totient function
- On the \(k\)-fold iterates of the Euler totient function at shifted primes
- On Iterates of Euler's φ-Function
- scientific article; zbMATH DE number 4128887
- scientific article; zbMATH DE number 4120274
- scientific article; zbMATH DE number 3887765
- scientific article; zbMATH DE number 6181639
- An Arithmetic Function Arising From the /phi Function
- Every Prime Has a Succinct Certificate
- scientific article; zbMATH DE number 5778238 (Why is no real title available?)
- scientific article; zbMATH DE number 1381105 (Why is no real title available?)
- scientific article; zbMATH DE number 48827 (Why is no real title available?)
- scientific article; zbMATH DE number 783336 (Why is no real title available?)
- Irreducible radical extensions and Euler-function chains
- Number of prime divisors of \(\varphi_ k(n)\), where \(\varphi_ k\) is the \(k\)-fold iterative of \(\varphi\)
- On the iterates of Euler's function
- On the Range of the Iterated Euler Function
- Prime chains and Pratt trees
- Smooth Values of the Iterates of the Euler Phi-Function
- Some remarks on the and on the functions
- The Lucas-Pratt primality tree
- On the normal order of \(\varphi_{k+1}(n)/\varphi_k(n)\), where \(\varphi_k\) is the \(k\)-fold iterate of Euler's function
- Smooth Values of the Iterates of the Euler Phi-Function
- Unbounded Sequences of Euler-Dedekind Means
- Infinite Branches of the Phi-Tree
- scientific article; zbMATH DE number 4029657 (Why is no real title available?)
- scientific article; zbMATH DE number 1381105 (Why is no real title available?)
- Some results in number theory, I
- On the number of prime divisors of the iterates of the Carmichael function
- On the \(k\)-fold iterates of the Euler totient function at shifted primes
- Primes in classes of the iterated totient function
- scientific article; zbMATH DE number 3248129 (Why is no real title available?)
- On the iterates of Euler's function
- ON THE ITERATES OF THE SHIFTED EULER’S FUNCTION
- The set of values of any finite iteration of Euler's \(\varphi\) function contains long arithmetic progressions
This page was built for publication: Two remarks on iterates of Euler's totient function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q652233)
