Über die Primteiler-Anzahl \(\omega\) (n). (On the prime divisor function \(\omega\) (n)) (Q2639897)
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 4185739
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Über die Primteiler-Anzahl \(\omega\) (n). (On the prime divisor function \(\omega\) (n)) |
scientific article; zbMATH DE number 4185739 |
Statements
Über die Primteiler-Anzahl \(\omega\) (n). (On the prime divisor function \(\omega\) (n)) (English)
0 references
1990
0 references
It is shown by analytical means that, if one assumes the Riemann hypothesis, the asymptotic formula \[ \sum_{n\leq x}\omega (n)=x \ln \ln x+B-x\int^{x^{1/2}}_{1}\frac{\{t\}}{t^ 2(\ln x-\ln t)}dt+O(x^{1/2+\epsilon}) \] holds. This improves a result of \textit{B. Saffari} [Enseign. Math., II. Sér. 14, 205-224 (1970; Zbl 0211.380)], who got a weaker error term by using the Dirichlet ``hyperbola method''. The above formula, in turn, implies the Riemann hypothesis.
0 references
number of prime divisors
0 references
Riemann hypothesis
0 references
asymptotic formula
0 references
0 references
0 references
0.8619821
0 references
0.8580794
0 references
