Structure and Randomness in the Prime Numbers
We give a quick tour through some topics in analytic prime number theory, focusing in particular on the strange mixture of order and chaos in the primes. For instance, while primes do obey some obvious patterns (e.g. they are almost all odd), and have a very regular asymptotic distribution (the prime number theorem), we still do not know a deterministic formula to quickly generate large numbers guaranteed to be prime, or to count even very simple patterns in the primes, such as twin primes p,p+2. Nevertheless, it is still possible in some cases to understand enough of the structure and randomness of the primes to obtain some quite nontrivial results.
KeywordsArithmetic Progression Random Model Riemann Zeta Function Simple Pattern Riemann Hypothesis
Unable to display preview. Download preview PDF.
- Euclid, The Elements, circa 300 BCE Google Scholar
- Great Internet Mersenne Prime Search. http://www.mersenne.org (2008)
- Ben Green and Terence Tao, Linear equations in primes. Preprint. http://arxiv.org/abs/math/0606088, 84 pages (April 22, 2008)
- Ben Green and Terence Tao, The Möbius function is asymptotically orthogonal to nilsequences. Preprint. http://arxiv.org/abs/0807.1736, 22 pages (April 26, 2010)
- Ben Green, Terence Tao and Tamar Ziegler, The inverse conjecture for the Gowers norm. Preprint Google Scholar
- Polymath4 project: Deterministic way to find primes. http://michaelnielsen.org/polymath1/index.php?title=Finding_primes
- Charles-Jean de la Vallée Poussin, Recherches analytiques de la théorie des nombres premiers. Annales de la Société scientifique de Bruxelles 20, 183–256 (1896) Google Scholar
- Ivan M. Vinogradov, The method of trigonometrical sums in the theory of numbers (Russian). Travaux de l’Institut Mathématique Stekloff 10 (1937) Google Scholar