Skip to main content

The Primes Viewed at Large

  • Chapter
  • First Online:
Prime Numbers and Computer Methods for Factorization

Part of the book series: Modern Birkhäuser Classics ((MBC))

  • 2770 Accesses

Abstract

Not very much is known about the distribution of the primes. On one hand, their distribution in short intervals seems extremely irregular. This is the reason why it appears impossible to find a simple formula describing the distribution of the primes in any detail. On the other hand, the distribution of the primes, viewed at large, can be very well approximated by simple formulas.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Bibliography

  1. James F. Jones, Daihachiro Sato, Hideo Wada and Douglas Wiens, “Diophantine Representation of the Set of Prime Numbers,” Am. Math. Monthly 83 (1976) pp. 449–464.

    Article  MathSciNet  MATH  Google Scholar 

  2. G. W. Fung and H. C Williams, “Quadratic Polynomials Which Have a High Density of Prime Values,” Math. Comp. 55 (1990) pp. 345–353.

    Article  MathSciNet  MATH  Google Scholar 

  3. G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, Fifth edition, Oxford, 1979, pp. 359–367.

    MATH  Google Scholar 

  4. D. J. Newman, “Simple Analytic Proof of the Prime Number Theorem,” Am. Math. Monthly 87 (1980) pp. 693–696.

    Article  MATH  Google Scholar 

  5. E. Landau, Handbuch der Lehre von der Verteilung der Primzahlen, Chelsea, New York, 1953. (Reprint.)

    MATH  Google Scholar 

  6. R. P. Brent, J. van de Lune, H. J. J. te Riele and D. T. Winter, “On the Zeros of the Riemann Zeta function in the Critical Strip, I—IV,” Math. Comp. 33 (1979) pp. 1361– 1372, Math. Comp. 39 (1982) pp. 681–688, Math. Comp. 41 (1983) pp. 759–767, and Math. Comp. 46 (1986) pp. 667–681.

    Article  MathSciNet  MATH  Google Scholar 

  7. J. van de Lune and H. J. J. te Riele, “Recent Progress on the Numerical Verification of the Riemann Hypothesis,” CWI Newsletter No. 2 (March 1984) pp. 35–37, and Personal communication.

    Google Scholar 

  8. A. M. Odlyzko, “The 1020-th Zero of the Riemann Zeta Function and 175 Million of its Neighbors,” (to appear).

    Google Scholar 

  9. Hans Riesel and Gunnar Göhl, “Some Calculations Related to Riemann’s Prime Number Formula,” Math. Comp. 24 (1970) pp. 969–983.

    MathSciNet  MATH  Google Scholar 

  10. Herman J. J. te Riele, “On the Sign of the Difference π(x) − li(x),” Math. Comp. 48 (1987) pp. 323–328.

    MathSciNet  MATH  Google Scholar 

  11. A. Walfisz, Weylsche Exponentialsummen in der neueren Zahlentheorie, VEB Deutscher Verlag der Wissenschaften, Berlin, 1963.

    MATH  Google Scholar 

  12. W. J. Ellison and M. Mendès France, Les Nombres Premiers Hermann, Paris, 1975.

    MATH  Google Scholar 

  13. J. Barkley Rosser and L. Schoenfeld, “Approximate Formulas for Some Functions of Prime Numbers, III” Journ. Math. 6 (1962) pp. 64–94.

    Google Scholar 

  14. J. Barkley Rosser and L. Schoenfeld, “Sharper Bounds for the Chebyshev Functions θ{x) and ψ(x),” Math. Comp. 29 (1975) pp. 243–269.

    MathSciNet  MATH  Google Scholar 

  15. Lowell Schoenfeld, “Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x), II,” Math. Comp. 30 (1976) pp. 337–360.

    MathSciNet  MATH  Google Scholar 

  16. Guy Robin, “Estimation de la Fonction de Tchebychef Θ sur le k-ième Nombre Premier et Grandes Valeurs de la Fonction ω (n) Nombre de Diviseurs Premiers de nActa Arith. 52 (1983) pp. 367–389.

    MathSciNet  Google Scholar 

  17. Harold G. Diamond, –Elementary Methods in the Study of the Distribution of Prime Numbers,” Bull. Am. Math. Soc, New Series 7 (1982) pp. 553–589.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hans Riesel .

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Riesel, H. (2011). The Primes Viewed at Large. In: Prime Numbers and Computer Methods for Factorization. Modern Birkhäuser Classics. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-0-8176-8298-9_2

Download citation

Publish with us

Policies and ethics