The average number of divisors of the Euler function

DOI10.1007/S11139-017-9897-2MaRDI QIDQ1991659zbMATH OpenOpenAlexFDO

Authors Sungjin Kim

Publication date 30 October 2018

Published in The Ramanujan Journal (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1605.04933

zbMATH Keywords

average ordersCarmichael functionEuler functionnumber of divisors

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37)

Abstract: The upper bound and the lower bound of average numbers of divisors of Euler Phi function and Carmichael Lambda function are obtained by Luca and Pomerance (see cite{LP}). We improve the lower bound and provide a heuristic argument which suggests that the upper bound given by cite{LP} is indeed close to the truth.

Review text

Let \(\phi(n),~\lambda(n)\) be the Euler function and the Carmichael \(\lambda\) function of \(n\), respectively, and let \(\tau(n)\) be the number of divisors of \(n\). The paper studies the average value of \(\tau(\phi(n))\) and \(\tau(\lambda(n))\) as \(n\) ranges over positive integers in \([1,x]\). Putting \[ F(x)={\text{ exp}}\left(e^{-\gamma/2} {\sqrt{\frac{\log x}{\log\log x}}}\right), \] the main result is the paper is that \[ \frac{1}{x}\sum_{n\le x} \tau(\phi(n))\ge \frac{1}{x}\sum_{n\le x}\tau(\lambda(n))\ge F(x)^{2+o(1)} \] as \(x\to\infty\). This improves upon a result of the reviewer with \textit{C. Pomerance} [Publ. Math. 70, No. 1--2, 125--148 (2007; Zbl 1127.11065)] who proved the above inequality with the exponent \(1/7\) on the right-hand side instead of \(2\). It is conjectured that the correct exponent should be \(2{\sqrt{2}}\) and an upper bound on the left-hand side with this exponent was proved in [loc. cit.]. In addition, the author proves that \[ \sum_{n\le x} \tau(\lambda(n))=o\left(\sum_{n\le x} \tau(\phi(n))\right) \] as \(x\) tends to infinity. The proofs use ingredients from [loc. cit.] combined with a version of the Bombieri-Vinogradov theorem on primes in progressions due to \textit{D. Fiorilli} [Can. J. Math. 64, No. 5, 1019--1035 (2012; Zbl 1315.11078)].

Recommendations

• On the average number of divisors of the Euler function
• Euler's function and the sum of divisors.
• The average number of divisors in certain arithmetic sequences
• On the average of the sum-of-a-divisors function
• scientific article; zbMATH DE number 1936542
• SOME DIVISIBILITY PROPERTIES OF THE EULER FUNCTION
• scientific article; zbMATH DE number 824641
• On the average value of the first n values of the sum-of-divisors function
• scientific article; zbMATH DE number 5150153
• On the average value of the first n values of the Euler function

Cites work

• Dynamics in a two-species competitive model of plankton allelopathy with delays and feedback controls
• Multiplicative number theory. I. Classical theory
• On a Theorem of Bombieri, Friedlander, and Iwaniec
• On the average number of divisors of the Euler function
• On the normal number of prime factors of \(\phi(n)\)
• Primes in arithmetic progressions to large moduli

Cited in

(7)

• Arithmetic properties of (n)/(n) and the structure of the multiplicative group modulo n
• Compositions with the Euler and Carmichael functions
• SOME DIVISIBILITY PROPERTIES OF THE EULER FUNCTION
• scientific article; zbMATH DE number 5150153 (Why is no real title available?)
• On the average number of divisors of the Euler function
• Divisors of the Euler and Carmichael functions
• ON THE INDEX OF COMPOSITION OF THE EULER FUNCTION AND OF THE SUM OF DIVISORS FUNCTION

This page was built for publication: The average number of divisors of the Euler function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1991659)