Abstract
This chapter contains several original papers. These give the most essential sampling of the enormous body of material on the Riemann zeta function, the Riemann hypothesis, and related theory. They give a chronology of milestones in the development of the theory contained in the previous chapters. We begin with Chebyshev’s groundbreaking work on π(x), continue through Riemann’s proposition of the Riemann hypothesis, and end with an ingenious algorithm for primality testing. These papers place the material in historical context and illustrate the motivations for research on and around the Riemann hypothesis. Most papers are preceded by a short biographical note on the author(s) and all are preceded by a short review of the material they present.
To appreciate the living spirit rather than the dry bones of mathematics, it is necessary to inspect the work of a master at first hand. Textbooks and treatises are an unavoidable evil … The very crudities of the first attack on a significant problem by a master are more illuminating than all the pretty elegance of the standard texts which has been won at the cost of perhaps centuries of finicky polishing.
Eric Temple Bell
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
L. M. Adleman and M.-D. Huang, Primality Testing and Abelian Varieties over Finite Fields, Lecture Notes in Math. 1512, Springer-Verlag, New York, 1992.
L. M. Adleman, C. Pomerance, and R. S. Rumely, On distinguishing prime numbers from composite numbers, Ann. of Math. 117 (1983), 173–206.
M. Agrawal and S. Biswas, Primality and identity testing via Chinese remaindering, Journal of the ACM 50 (2003), 429–443.
M. Agrawal, N. Kayal, and N. Saxena, PRIMES is in P, preprint (http://www.cse.iitk.ac.in/news/primality.ps), August 2002.
T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, New York, 1997.
A. O. L. Atkin, Lecture notes of a conference, Boulder (Colorado), Manuscript, August 1986.
R. C. Baker and G. Harman, The Brun-Titchmarsh Theorem on average, in Analytic Number Theory, VolumeI (Allerton Park, IL, 1995), Progr. Math. 138, 39–103, Birkhäuser Boston, Boston, MA, 1996.
R. Bhattacharjee and P. Pandey, Primality testing, Technical report, IIT Kanpur, 2001; available at http://www.cse.iitk.ac.in/research/btp2001/primality.html.
R. D. Carmichael, Note on a number theory function, Bull. Amer. Math. Soc. 16 (1910), 232–238.
E. Fouvry, Théorème de Brun-Titchmarsh; application au théorème de Fermat, Invent. Math. 79 (1985), 383–407.
S. Goldwasser and J. Kilian, Almost all primes can be quickly certified, in Proc. Annual ACM Symposium on the Theory of Computing, 316–329, 1986.
R. Gupta and M. Ram Murty, A remark on Artin’s conjecture, Invent. Math. 78 (1984), 127–130.
R. Gupta, V. Kumar Murty, and M. Ram Murty, The Euclidian algorithm for S-integers, Number Theory(Montreal, Que., 1985), CMS Conf. Proc. 7 (1987), 189–202.
M. Goldfeld, On the number of primes pfor which p+ahas a large prime factor, Mathematika 16 (1969), 23–27.
D. R. Heath-Brown, Artin’s conjecture for primitive roots, Quart. J. Math. Oxford 37 (1986), 27–38.
N. Kayal and N. Saxena, Towards a deterministic polynomial-time test, Technical report, IIT Kanpur, 2002; available at http://www.cse.iitk.ac.in/research/btp2002/primality.html.
A. Kalai, A. Sahai, and M. Sudan, Notes on primality test and analysis of AKS, Private communication, August 2002.
J. V. Leeuwen (ed.), Handbook of Theoretical Computer Science, Volume A, MIT Press, Cambridge, MA, 1990.
H. W. Lenstra, Jr., Primality testing with cyclotomic rings, unpublished (see http://cr.yp.to/papers.html#aks for an exposition of Lenstra’s argument), August 2002.
R. Lidl and H. Niederreiter, Introduction to Finite Fields and their Applications, Cambridge Univ. Press, Cambridge, 1986.
H. W. Lenstra, Jr. and C. Pomerance, Primality testing with gaussian periods, Private communication, March 2003.
H. W. Lenstra, Jr. and C. Pomerance, Remarks on Agrawal’s conjecture, unpublished (http://www.aimath.org/WWN/ primesinp/articles/html/50a/), March 2003.
M. Macaj, Some remarks and questions about the AKS algorithm and related conjecture, unpublished (http://thales.doa.fmph.uniba.sk/macaj/aksremarks.pdf), December 2002.
G. L. Miller, Riemann’s hypothesis and tests for primality, J. Comput. Sys. Sci. 13 (1976), 300–317.
M. Nair, On Chebyshev-type inequalities for primes, Amer. Math. Monthly 89 (1982), 126–129.
V. Pratt, Every prime has a succinct certificate, SIAM Journal on Computing 4 (1975), 214–220.
M. O. Rabin, Probabilistic algorithm for testing primality, J. Number Theory 12 (1980), 128–138.
R. Solovay and V. Strassen, A fast Monte-Carlo test for primality, SIAM Journal on Computing 6 (1977), 84–86.
J. von zur Gathen and J. Gerhard, Modern Computer Algebra, Cambridge Univ. Press, Cambridge, 1999.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Borwein, P., Choi, S., Rooney, B., Weirathmueller, A. (2008). The Experts Speak for Themselves. In: Borwein, P., Choi, S., Rooney, B., Weirathmueller, A. (eds) The Riemann Hypothesis. CMS Books in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-0-387-72126-2_12
Download citation
DOI: https://doi.org/10.1007/978-0-387-72126-2_12
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-72125-5
Online ISBN: 978-0-387-72126-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)