On the third iterates of the φ- and σ-functions (Q3344277)
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 3877291
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the third iterates of the φ- and σ-functions |
scientific article; zbMATH DE number 3877291 |
Statements
On the third iterates of the φ- and σ-functions (English)
0 references
1984
0 references
sum of divisors function
0 references
lower bounds
0 references
Euler phi-function
0 references
sieve method
0 references
0.9185957908630372
0 references
0.8474364876747131
0 references
0.823707103729248
0 references
0.8202788829803467
0 references
Let \(\sigma\) be the divisor-sum function and let \(\phi\) be the Euler phi- function. Set \(\sigma_ 1(n)=\sigma (n)\) and \(\phi_ 1(n)=\phi (n)\), and for \(k>1\) define \(\sigma_ k(n)=\sigma_ 1(\sigma_{k-1}(n))\) and \(\phi_ k(n)=\phi_ 1(\phi_{k-1}(n))\). Finally, denote by \(N_{\sigma}(k,\alpha,x)\) the number of integers \(n\leq x\) for which \(\sigma_ k(n)<\alpha n\) and by \(N_{\phi}(k,\alpha,x)\) the number of integers \(n\leq x\) for which \(\phi_ k(n)>\alpha n\). In 1967 Erdős obtained bounds on \(N_{\sigma}(k,\alpha,x)\) and \(N_{\phi}(k,\alpha,x)\) for \(k=2\) and 3. In particular he showed that for every \(\alpha >0\) and \(\epsilon >0\), \(N_{\sigma}(3,\alpha,x)<x(\log x)^{\epsilon}/\log^ 2x\) for large values of x and \(N_{\phi}(3,\alpha,x)<x(\log x)^{\epsilon}/\log^ 2x\) for large values of x. In the present paper a sieve method is used to prove that for \(\alpha >\alpha_ 0\) and large x, \(N_{\sigma}(3,\alpha,x)>x/\log^ 2x\). It is stated that an analogous proof can be used to show that for \(\alpha <\alpha_ 1\) and large x, \(N_{\phi}(3,\alpha,x)>x/\log^ 2x.\) In the last section of the paper a proof is sketched which shows that the lower bounds on \(N_{\sigma}\) and \(N_{\phi}\) for \(k=3\) can be improved by a factor of (log log x)\({}^ t\) where t is arbitrarily large.
0 references