On a constant related to the prime counting function (Q327327)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On a constant related to the prime counting function |
scientific article; zbMATH DE number 6640713
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a constant related to the prime counting function |
scientific article; zbMATH DE number 6640713 |
Statements
On a constant related to the prime counting function (English)
0 references
19 October 2016
0 references
Recall that \(\pi(x)\) denotes the number of primes not exceeding \(x\), and let \[ S(x)=\sum_{2\leq n\leq x}\frac{1}{\pi(n)}-\left(\frac{1}{2}\log^2 x-\log x-\log\log x\right). \] It is known that \(S(x)\) tends to a limit, say \(C\), as \(x\to\infty\). In the paper under review, the authors prove that \(6.6840<C<6.7830\). More precisely, they obtain some explicit bounds concerning \(S(x)\).
0 references
explicit estimates
0 references
prime numbers
0 references
0 references
0 references
0.91046894
0 references
0.9104265
0 references
0.9048467
0 references
0.90161645
0 references
0.8997892
0 references
0.8995187
0 references
0.89909726
0 references
0.89796126
0 references