Granville, A;
(2015)
What is the best approach to counting primes?
In: Kennedy, SF and Albers, DJ and Alexanderson, GL and Dumbaugh, D and Farris, FA and Haunsperger, DB and Zorn, P, (eds.)
A Century of Advancing Mathematics.
(pp. 83-116).
MAA Press: Washington DC, USA.
![[thumbnail of 1406.3754v1.pdf]](https://discovery-pp.ucl.ac.uk/style/images/fileicons/text.png) |
Text
1406.3754v1.pdf Access restricted to UCL open access staff Download (352kB) |
Abstract
As long as people have studied mathematics, they have wanted to know how many primes there are. Getting precise answers is a notoriously difficult problem, and the first suitable technique, due to Riemann, inspired an enormous amount of great mathematics, the techniques and insights permeating many different fields. In this article we will review some of the best techniques for counting primes, centering our discussion around Riemann's seminal paper. We will go on to discuss its limitations, and then recent efforts to replace Riemann's theory with one that is significantly simpler.
| Type: | Book chapter |
|---|---|
| Title: | What is the best approach to counting primes? |
| Publisher version: | https://www.maa.org/press/maa-reviews/a-century-of... |
| Language: | English |
| Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions. |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences |
| URI: | https://discovery-pp.ucl.ac.uk/id/eprint/10038645 |
Archive Staff Only
 |
View Item |
