On the distribution of the values of arithmetic functions. The number of prime factors of an integer (Q1265671): Difference between revisions

Let \(N(x,m)\) be the number of positive integers \(n\leq x\) for which \(\Omega (n) =m\). \(\Omega(n)\) denotes the total number of prime factors of \(n\). The behaviour of \(N(x,m)\) was studied by \textit{L. Sathe} (essentially elementary) [J. Indian Math. Soc., New Ser. 17, 63-82 (1953; Zbl 0050.27102); ibid. 83-141 (1953; Zbl 0051.28008); ibid. 18, 27-42 (1954; Zbl 0055.27502); ibid. 43-81 (1954; Zbl 0058.27601)] and \textit{A. Selberg} (analytical) [J. Indian Math. Soc. 18, 83-87 (1954; Zbl 0057.28502)] in the range \(1\leq m\leq(2-\varepsilon) \log\log x\). \textit{J.-L. Nicolas} [Acta Arith. 44, 191-200 (1984; Zbl 0547.10038)] described an elementary method that works for \(m\geq (2+\varepsilon) \log \log x\), \(x2^{-m} \to\infty\). \textit{M. Balazard}, \textit{H. Delange} and \textit{J.-L. Nicolas} [C. R. Acad. Sci., Paris, Sér. I 306, 511-514 (1988; Zbl 0644.10032)] gave an asymptotic formula that covers all \(m\geq 1\) with \(x2^{-m} \to\infty\). In the present article the author proves a rather precise asymptotic expansion for \(N(x,m)\) which is valid for \(m\leq (3-\varepsilon) \log\log x\), and in particular throws some new light on the crucial values \(m\sim 2\log \log x\). The proof follows Selberg's idea and uses a method of \textit{B. van der Waerden} [Appl. Sci. Res. B2, 33-45 (1951; Zbl 0045.06603)] for evaluating integrals of the type \[ \int_{| z|=r} F(z) (a-z)^{-1} z^{-m} \exp (Xz)dz. \] Further, the author gives an analytical proof of an improved version of Nicolas' result.