What is the Riemann Hypothesis?

It is the conjecture that all nontrivial zeros of the Riemann zeta function have real part one half; it is equivalent to the sharpest possible error term in the prime number theorem and is one of the central open problems in mathematics.

How can analysis say anything about whole numbers?

By packaging arithmetic data into Dirichlet series and other analytic objects, continuous methods such as contour integration extract asymptotic counts that purely discrete arguments cannot reach.

Analytic Number Theory

Analytic number theory uses the tools of real and complex analysis — generating functions, contour integration, and asymptotics — to answer questions about integers, above all the distribution of prime numbers.

Definition

Analytic number theory is the branch of number theory that studies the integers, and especially the primes, by encoding arithmetic data in analytic objects such as Dirichlet series and applying the methods of mathematical analysis.

Scope

This area covers Dirichlet series and the Riemann zeta function, the analytic proof of the prime number theorem, Dirichlet characters and L-functions (and primes in arithmetic progressions), sieve methods, exponential sums, and the connection between the zeros of zeta and L-functions and the fine distribution of primes. It complements elementary methods by extracting quantitative, asymptotic information.

Sub-topics

Core questions

How are arithmetic functions encoded as Dirichlet series, and what does the analytic behaviour of those series reveal?
Why does the prime number theorem hold, and how do the zeros of the zeta function control the error term?
How does the nonvanishing of L-functions yield Dirichlet's theorem on primes in arithmetic progressions?
How do sieve methods bound the number of integers or primes with prescribed factorization constraints?

Key theories

Riemann zeta function and the explicit formula: The zeta function's Euler product links it to the primes and its analytic continuation and zeros (via the explicit formula) translate directly into statements about prime counting.
Prime number theorem: The number of primes up to x is asymptotic to x over the natural logarithm of x; the proof depends on the zeta function having no zeros on the line where the real part equals one.
L-functions and sieves: Dirichlet L-functions extend the zeta method to arithmetic progressions, while sieve methods give upper and lower bounds for sifted sets, driving modern results on gaps between primes.

Clinical relevance

Estimates from analytic number theory underpin the analysis of cryptographic key distributions and random number models, and sieve and exponential-sum techniques feed into algorithm analysis and pseudorandomness; the Riemann Hypothesis (a central open problem here) governs the best possible error terms in prime counting.

History

Dirichlet introduced analytic methods in 1837 to prove infinitely many primes in arithmetic progressions. Riemann's 1859 memoir connected prime counting to the complex zeros of the zeta function, and Hadamard and de la Vallee Poussin independently proved the prime number theorem in 1896, founding the modern subject.

Key figures

Bernhard Riemann
Peter Gustav Lejeune Dirichlet
Jacques Hadamard
Charles-Jean de la Vallee Poussin

Seminal works

davenport2000

Frequently asked questions

What is the Riemann Hypothesis?: It is the conjecture that all nontrivial zeros of the Riemann zeta function have real part one half; it is equivalent to the sharpest possible error term in the prime number theorem and is one of the central open problems in mathematics.
How can analysis say anything about whole numbers?: By packaging arithmetic data into Dirichlet series and other analytic objects, continuous methods such as contour integration extract asymptotic counts that purely discrete arguments cannot reach.