## Harald Cramér and the distribution of prime numbers (1995)

Venue: | Scandanavian Actuarial J |

Citations: | 20 - 2 self |

### BibTeX

@ARTICLE{Granville95haraldcramér,

author = {Andrew Granville},

title = {Harald Cramér and the distribution of prime numbers},

journal = {Scandanavian Actuarial J},

year = {1995},

volume = {1},

pages = {12--28}

}

### OpenURL

### Abstract

“It is evident that the primes are randomly distributed but, unfortunately, we don’t know what ‘random ’ means. ” — R. C. Vaughan (February 1990). After the first world war, Cramér began studying the distribution of prime numbers, guided by Riesz and Mittag-Leffler. His works then, and later in the midthirties, have had a profound influence on the way mathematicians think about the distribution of prime numbers. In this article, we shall focus on how Cramér’s ideas have directed and motivated research ever since. One can only fully appreciate the significance of Cramér’s contributions by viewing his work in the appropriate historical context. We shall begin our discussion with the ideas of the ancient Greeks, Euclid and Eratosthenes. Then we leap in time to the nineteenth century, to the computations and heuristics of Legendre and Gauss, the extraordinarily analytic insights of Dirichlet and Riemann, and the crowning glory of these ideas, the proof the “Prime Number Theorem ” by Hadamard and de la Vallée Poussin in 1896. We pick up again in the 1920’s with the questions asked by Hardy and Littlewood,

### Citations

876 | An Introduction to the Theory of Numbers - Hardy, Wright - 1979 |

248 | Analytic Number Theory - Iwaniec, Kowalski |

222 |
Introduction to analytic and probabilistic number theory
- Tenenbaum
- 1995
(Show Context)
Citation Context ...isk. Many of the technical results about multiplicative functions can be extended to wider classes, though not all, and not without some significant complications. Books by Elliott [El] and Tenenbaum =-=[Te]-=- are probably the best sources for advanced material in this area. 0.8. More details / more sketch for the proof of the prime number theorem. The existing data lends support to Gauss’s belief that π(x... |

160 | Sieve methods - Halberstam, Richert - 1974 |

140 |
Some problems of `Partitio Numerorum': III On the expression of a number as a sum of primes
- Hardy, Littlewood
- 1923
(Show Context)
Citation Context ...ing the prime number theorem (9) 11 For a thorough analysis of how and why one can avoid complex analysis, and indeed any type of ‘infinite summation’ in such a proof see Ingham’s elegant Math Review =-=[9]-=-.sTHE DISTRIBUTION OF PRIME NUMBERS 7 On 25th October 1920 G. H. Hardy read Cramér’s paper “On the distribution of primes” to the Cambridge Philosophical Society. Here Cramér develops a ‘statistical a... |

140 | Prime numbers: a computational perspective - Crandall, Pomerance - 2001 |

121 |
Multiplicative Number Theory
- Davenport
- 1980
(Show Context)
Citation Context ...he plane. We do this in part by having a pretty good idea of how many zeros there are of ζ(s) up to a certain height, and there are many other details besides. These all had to be worked out (see, eg =-=[Da]-=- or [Ti], for further details), after Riemann’s initial plan – this is what took forty years! At the end, if all goes well, then one has the exact formula (0.1.3) ψ(x) = ∑ p prime p m ≤x m≥1 log p = x... |

120 | lectures on the interface between analytic number theory and harmonic analysis - Montgomery, Ten - 1994 |

85 | Topics in multiplicative number theory - Montgomery - 1971 |

50 |
The distribution of prime numbers
- Ingham
- 1971
(Show Context)
Citation Context ... (0.1.3) an equivalence, more-or-less, between questions about the distribution of primes and questions about the distribution of zeros of ζ(s). This is discussed in the introduction to Ingham’s book =-=[I1]-=-: “Every known proof of the prime number theorem is based on a certain property of the complex zeros of ζ(s), and this conversely is a simple consequence of the prime number theorem itself. It seems t... |

47 |
Le Grand Crible dans la Théorie Analytique des Nombres. Societé Mathématique de
- Bombieri
- 1974
(Show Context)
Citation Context ...R2 log 2 x provided χ ∈ ΞR, where ΞR is the set of characters χ with conductors ≤ R for which L(s, χ) has no zeros ρ with |Im(ρ)| ≤ R2 2 log R and Re(ρ) > 1 − log x . Now the remark to Theorem 14 of =-=[Bo]-=- implies ( ) that |ΞR| ≪ exp . Hence by Corollary 13.7a we have that if R ≤ x1/4 then 23 log2 R log x ∑ q≤x 1/2 /R 1 ϕ(q) ∑ χ (mod q) χ∈ΞR |ψ(x, χ)| ≪ x R log3 x log log x, provided that we can obtai... |

44 | On the order of magnitude of the difference between consecutive prime numbers - Cramér - 1936 |

39 | Multiplicative number theory I. Classical theory - Montgomery, Vaughan - 2007 |

33 | Primes in short intervals - Maier - 1985 |

26 |
The Theory of the Riemann Zeta-Function, 2nd Ed
- Titchmarsh
- 1986
(Show Context)
Citation Context .... We do this in part by having a pretty good idea of how many zeros there are of ζ(s) up to a certain height, and there are many other details besides. These all had to be worked out (see, eg [Da] or =-=[Ti]-=-, for further details), after Riemann’s initial plan – this is what took forty years! At the end, if all goes well, then one has the exact formula (0.1.3) ψ(x) = ∑ p prime p m ≤x m≥1 log p = x − ∑ ρ: ... |

19 | On the normal density of primes in small intervals and the difference between consecutive primes - Selberg - 1943 |

17 | The prime k-tuplets conjecture on average., in ”Analytic Number Theory - Balog - 1990 |

12 | The Prime Numbers and Their Distribution - Tenenbaum, Mendes-France |

11 | Limitations to the equi–distribution of primes I - Friedlander, Granville - 1989 |

7 | The development of prime number theory, Springer-Verlag - Narkiewicz - 2000 |

6 | Some theorems concerning prime numbers, Arkiv för Mathematik, Astronom o - Cramér - 1920 |

5 | Prime numbers and probability - Cramér - 1935 |

5 | Multiplicative functions on arithmetic progressions II, Mathematika 35 - Elliott - 1988 |

2 | On the distribution of primes - Cramér - 1920 |

2 |
Duality in analytic number theory
- Elliott
- 1997
(Show Context)
Citation Context ...s inside the unit disk. Many of the technical results about multiplicative functions can be extended to wider classes, though not all, and not without some significant complications. Books by Elliott =-=[El]-=- and Tenenbaum [Te] are probably the best sources for advanced material in this area. 0.8. More details / more sketch for the proof of the prime number theorem. The existing data lends support to Gaus... |

1 | Limitations to the equi–distribution of primes III - Friedlander, Granville - 1992 |

1 | Relevance of the residue class to the abundance of primes - Friedlander, Granville - 1992 |