Analytic Number Theory

Key Results

Examples

In Depth

Analytic number theory uses tools from complex analysis and real analysis to study the distribution of primes and arithmetic functions. Its central object is the Riemann zeta function \(\zeta(s)=\sum_{n=1}^\infty n^{-s}\), which encodes prime distribution via the Euler product \(\prod_p(1-p^{-s})^{-1}\).

The prime number theorem (PNT): \(\pi(x)\sim x/\ln x\) as \(x\to\infty\). Proved independently by Hadamard and de la Vallée Poussin in 1896 using the fact that \(\zeta(s)\neq0\) on the line \(\text{Re}(s)=1\). An elementary proof (without complex analysis) was found by Selberg and Erdős in 1949.

Dirichlet's theorem on primes in arithmetic progressions: if \(\gcd(a,q)=1\), there are infinitely many primes \(p\equiv a\pmod{q}\). The proof uses Dirichlet \(L\)-functions \(L(s,\chi)=\sum_{n=1}^\infty\chi(n)/n^s\) for Dirichlet characters \(\chi\) modulo \(q\).

The Riemann hypothesis (RH): all non-trivial zeros of \(\zeta(s)\) lie on the critical line \(\text{Re}(s)=1/2\). RH implies the sharpest known error term in the PNT: \(\pi(x)=\text{Li}(x)+O(\sqrt{x}\ln x)\). It remains unproved and is one of the Millennium Prize Problems.

The circle method (Hardy–Littlewood–Ramanujan) uses Fourier analysis on \(\mathbb{Z}/N\mathbb{Z}\) to count representations of integers as sums of primes or powers. It proved Vinogradov's theorem: every sufficiently large odd integer is a sum of three primes.

Key Properties & Applications

The explicit formula for \(\pi(x)\): \(\pi(x)=\text{Li}(x)-\sum_\rho\text{Li}(x^\rho)-\ln2+\int_x^\infty\frac{dt}{t(t^2-1)\ln t}\) where the sum is over non-trivial zeros \(\rho\) of \(\zeta\). Each zero contributes an oscillation to \(\pi(x)\); the Riemann hypothesis controls the size of these oscillations.

The large sieve inequality bounds exponential sums over primes and is a key tool in analytic number theory. It implies the Bombieri–Vinogradov theorem: primes are equidistributed in arithmetic progressions on average, with an error as good as GRH would give for individual progressions.

Exponential sums \(\sum_{n\leq N}e^{2\pi i f(n)}\) (Weyl sums) measure the equidistribution of sequences modulo 1. Weyl's theorem: \(\{n^k\alpha\}\) is equidistributed for irrational \(\alpha\). Van der Corput's method bounds these sums using repeated differencing.

Further Reading & Context

The study of analytic number theory connects to many areas of mathematics and its applications. Understanding the foundational definitions and theorems provides the basis for advanced work in analysis, algebra, and applied mathematics.

Historical development: most mathematical concepts evolved over centuries, with contributions from mathematicians across many cultures. The modern axiomatic treatment provides rigor, while computational tools enable practical application.

In modern mathematics, this topic appears in graduate courses and research across pure and applied mathematics. Connections to computer science, physics, and engineering make it a versatile and important area of study. Mastery of the core results and techniques opens doors to research in number theory, analysis, geometry, and beyond.

Recommended next steps: work through the standard theorems with full proofs, explore the connections to related topics listed above, and practice with a variety of problems ranging from computational exercises to theoretical proofs. The interplay between different areas of mathematics is one of the subject's greatest rewards.

Deep Dive: Analytic Number Theory

This lesson extends core ideas for analytic number theory with rigorous reasoning, edge-case checks, and application framing in number theory.

Practice Set

References & Editorial Notes

• Stewart, Calculus.
• Strang, Introduction to Linear Algebra.
• Apostol, Mathematical Analysis.

Last editorial review: 2026-04-14.