1 |
T. Kotnik, "The Prime-counting Function and its Analytic Approximations," Advanced Computat ional Mathematics, Vol. 29, No. 1, pp: 55-70, 2008.
DOI
ScienceOn
|
2 |
D. Goldfeld, "The Elementary Proof of the Prime Number Theorem: An Historical Perspective," The Mathematical Intelligencer, Vol. 31, No. 3, pp. 18-23, 2009.
DOI
ScienceOn
|
3 |
N. M. Temme, "Exponential, Logarithmic, Sine, and Cosign Integrals," NIST Handbook of Mathematical Functions, Cambridge University Press, 2010.
|
4 |
G. H. Hardy and E. M. Wright, "An Introduction to the Theory of Numbers," 5th ed., pp: 355-356, Oxford, England: Oxford University Press, 1979.
|
5 |
B. Riemann, "Ueber die Anzahl der Primzahlen unter einer gegebenen Grosse," Monatsberichte der Koniglich Preussischen Akademie der Wissenschaften zu Berlin, 1859. (D. R. Wilkins, "On the Number of Primes Less Than a Given Quantity, 1998.
|
6 |
J. M. Borwein, D. M. Bradley, and R. E. Crandall, "Computational Strategies for the Riemann Zata Function," Journal of Computational Applied Mathematics, Vol. 121, pp: 247-296, 2000.
DOI
ScienceOn
|
7 |
A. O. L. Atkin and D. J. Bernstein,"Prime Sieves Using Binary Quadratic Forms," Mathematics of Computation, Vol. 73, pp: 1023-1030, 2004.
|
8 |
D. Zagier, Newman's Short Proof of the Prime Number Theorem," American Mathematical Monthly, Vol. 104, No. 8, pp. 705-708, 1997.
DOI
ScienceOn
|