No label defined (Q3786539)
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 4049731
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4049731 |
Statements
1988
0 references
partial sum of exponential series
0 references
Cauchy's formula
0 references
total number of prime factors
0 references
asymptotic formula
0 references
0.8546568
0 references
0.8032204
0 references
0.7927525
0 references
0.7916031
0 references
0 references
Let N(x,k) denote the number of \(n\leq x\) which satisfy \(\Omega (n)=k\), where \(\Omega(n)\) is the total number of prime factors of n. The authors announce the remarkable asymptotic formula \[ (1)\quad N(x,k)=f(r)\frac{y}{\log y}P_{k-1}(2 \log \log y)\{1+O_ B(R_{\lambda}(y))\}, \] which holds uniformly for \(y=x2^{-k}\geq 3\), B a real constant \(<3/2\), where \(\lambda =\sup (1,\inf (B, (k-1)/2 \log\log y)),\) \(r=0\) if \(k=1\) and for \(k\geq 2\) \(r=2\frac{P_{k-2}(2 \log\log y)}{P_{k-1}(2 \log\log y)},\) \(P_ n(X)=1+\frac{X}{1!}+\cdot \cdot \cdot +\frac{X^ n}{n!},\) \(f(z)=\frac{2^{1-z}}{\Gamma (z+1)}\prod_{p\geq 3}(1-\frac{1}{p})^ z(1-\frac{z}{p})^{-1},\) and \(R_{\lambda}(y)\) is an explicitly given error term which tends to zero as \(y\to \infty\) uniformly in \(\lambda\). The method of proof is briefly sketched, and the details are to be found in the dissertation of \textit{M. Balazard} [Sur la répartition des valeurs de certaines fonctions arithmétiques, Université de Limoges, 1987]. The formula (1) practically resolves the problem of the evaluation of N(x,k), since it gives an asymptotic formula in the whole range \(1\leq k\leq \log x/\log 2\). For certain ranges of k one obtains from (1) the known results on N(x,k). Thus for \(1\leq k\leq (2-\epsilon)\log \log x\) (1) gives the classical formula of \textit{L. G. Sathe} and \textit{A. Selberg} [J. Indian Math. Soc., New Ser. 18, 83-87 (1954; Zbl 0057.285)], while for \((2+\epsilon)\log \log x\leq k\leq \log x/\log 2\) (1) essentially reproves the result of \textit{J.L. Nicolas} [Acta Arith. 44, 191-200 (1984; Zbl 0512.10034)]. In the ``critical'' range \(k\sim 2 \log \log x\) (1) also produces an asymptotic formula with a good error term.
0 references