Algorithms for Calculating ζ(s)
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).
KeywordsZeta Function Critical Line Riemann Hypothesis Bernoulli Polynomial Modern Computing
Unable to display preview. Download preview PDF.