Advertisement

Algorithms for Calculating ζ(s)

  • Peter Borwein
  • Stephen Choi
  • Brendan Rooney
  • Andrea Weirathmueller
Part of the CMS Books in Mathematics book series (CMSBM)

Abstract

The Riemann hypothesis has been open since its “proposal” in 1859. The most direct form of attack is to search for a counterexample, and also to search computationally for insight. Mathematicians from the time of Riemann have developed a large body of computational techniques and evidence in support of the Riemann hypothesis. The advent of modern computing empowered mathematicians with new tools, and motivated the development of more efficient algorithms for the computation of ζ(s).

Keywords

Zeta Function Critical Line Riemann Hypothesis Bernoulli Polynomial Modern Computing 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  • Peter Borwein
    • 1
  • Stephen Choi
    • 1
  • Brendan Rooney
    • 2
  • Andrea Weirathmueller
    • 3
  1. 1.Department of Mathematics & StatisticsSimon Fraser UniversityBurnabyCanada
  2. 2.Simon Fraser UniversityBurnabyCanada
  3. 3.University of Western OntarioFrederictonCanada

Personalised recommendations