No label defined (Q3836760)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1381105
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1381105 |
Statements
20 December 1999
0 references
Euler totient function
0 references
prime divisors
0 references
iteration
0 references
0.9026541113853456
0 references
0.8954639434814453
0 references
0.8786951899528503
0 references
0.8782800436019897
0 references
For positive integers \(k,n\) and real \(x\) let \(\varphi_k(n)=\varphi (\varphi_{k-1}(n))\) and \(x_k=\log x_{k-1}\) be the \(k\)-fold iterate of the Euler totient function and the logarithm function, respectively. Denote by \(\omega (n)\) the number of distinct prime factors of \(n\) and denote by \(\Omega (n)\) the number of prime divisors of \(n\) counted with multiplicity. Among others the authors prove in the paper that for each \(k\geq 1\) the asymptotic equation \[ \Omega (\varphi_k(n))-\omega (\varphi_k(n))=(1+o(1)){1\over {k!}}x^k_2x_4 \] holds for almost all \(n\leq x\).
0 references
