HomeScience GlossaryRiemann Hypothesis: The Conjecture That Controls Prime Numbers

Riemann Hypothesis: The Conjecture That Controls Prime Numbers

The Riemann hypothesis claims all nontrivial zeros of the zeta function lie on a single line. If true, it pins down exactly how far prime numbers can stray from their expected pattern.

Share
Science Glossary · Explore this series
April 4, 2026
Key Takeaways
  • Constrains how far primes deviate from their expected pattern
  • Over 10 trillion zeros verified, but proof covers infinitely many
  • Connects number theory to quantum physics via random matrices

The Riemann hypothesis is a conjecture about where the zeros of a mathematical function fall on the number line, and its truth or falsehood controls how far prime numbers can stray from their expected pattern.

Why It Matters

Prime numbers thin out as they get larger. The prime number theorem, proved independently by Jacques Hadamard and Charles de la Vallée-Poussin in 1896, quantifies that thinning: the number of primes below a given value n is approximately n divided by the natural logarithm of n. The Riemann hypothesis governs the error in that approximation.

Key figure

1859

Year Riemann proposed the hypothesis

If the hypothesis holds, the error term in the prime-counting function is as small as it can possibly be. If it fails, primes are wilder than mathematicians expect, and results across number theory that assume well-behaved primes would need revisiting.

Bernhard Riemann, a German mathematician at the University of Göttingen, proposed the conjecture in 1859 in a six-page paper titled "On the Number of Primes Less Than a Given Magnitude." It was his only paper on number theory. That single contribution became one of the most influential in the history of the field, according to the Encyclopaedia Britannica.

The hypothesis appeared on David Hilbert's 1900 list of 23 unsolved problems and again on the Clay Mathematics Institute's 2000 Millennium Prize list, the only problem to feature on both. The Clay Institute offers $1 million for a proof or disproof. The story of how a teenager stumbled onto the hidden regularity of primes illustrates the same deep pattern that Riemann formalized.

How It Works

Riemann's zeta function is defined, for complex numbers s with real part greater than 1, by the infinite series: the sum of 1/n^s for all positive integers n. Through analytic continuation, the function extends to the entire complex plane.

The function has "trivial" zeros at the negative even integers (−2, −4, −6, and so on). All other zeros are called nontrivial. Riemann conjectured that every nontrivial zero has its real part equal to exactly 1/2. Geometrically, this means every nontrivial zero lies on a single vertical line in the complex plane, called the critical line.

Key figure

10 trillion

Nontrivial zeros verified on the critical line

Computational verification supports the conjecture. Xavier Gourdon confirmed in 2004 that the first 10 trillion nontrivial zeros all lie on the critical line, with no exceptions. Yet computation cannot settle the question. No finite number of verified zeros constitutes a proof, because the conjecture concerns infinitely many of them.

G.H. Hardy proved in 1914 that infinitely many zeros do lie on the critical line. That result, while encouraging, falls short of showing all zeros behave this way. The gap between "infinitely many" and "all" remains open after more than a century.

Key Context

Hugh Montgomery, a number theorist at the University of Michigan, discovered in 1973 that the spacing between zeta zeros appears to follow the same statistical distribution as eigenvalues of random matrices in quantum physics. Physicist Freeman Dyson recognized the connection during a conversation at the Institute for Advanced Study. The pattern, now called the Montgomery-Odlyzko law after Andrew Odlyzko's numerical confirmation, is widely considered one of the most productive bridges between pure mathematics and physics.

Several unsolved math problems that sound deceptively simple share the Riemann hypothesis's character: easy to state, resistant to every known method of attack. Current work by James Maynard at Oxford and by Terence Tao at UCLA has separately tightened partial results on zero-free regions, but a full proof remains out of reach as of 2026.

FAQ

How is the Riemann hypothesis connected to prime numbers?

The nontrivial zeros of the zeta function directly control the error term in the prime-counting function. If all zeros lie on the critical line, the primes deviate from their average distribution by the smallest possible margin. A zero off the line would mean primes cluster or thin out in unexpected ways.

What would happen if someone proved the Riemann hypothesis?

Hundreds of theorems in number theory, currently conditional on the hypothesis being true, would become unconditional results. The proof would also confirm tight bounds on prime gaps and validate assumptions used in parts of analytic number theory. The Clay Mathematics Institute would award its $1 million Millennium Prize.

Has anyone come close to proving the Riemann hypothesis?

Hardyu0027s 1914 result showed infinitely many zeros lie on the critical line. Later work by Norman Levinson in 1974 showed that at least one-third of the zeros do. Recent advances by Maynard and others have improved zero-density estimates, but the full conjecture remains open after 167 years.

Why is the Riemann zeta function important beyond number theory?

The zeta function appears in quantum field theory, statistical mechanics, and random matrix theory. The Montgomery-Odlyzko connection links its zero spacing to energy-level statistics in quantum systems. Cryptographic systems like RSA rely in part on the difficulty of factoring large numbers, a problem whose complexity is related to prime distribution.

Related Reading

riemann hypothesis not random
Riemann Hypothesis, Energy Levels and the Endless Hunt for Zeros
collatz conjecture
Collatz Conjecture: Why 3n+1 Has Defied Proof Since 1937
mathematics
Mathematics: The Language That Describes Reality
Editorial illustration representing the prime number theorem and Gauss's discovery of logarithmic patterns in prime distribution. (Science Reader)
How a Teenager Found the Hidden Law of Prime Numbers

Sources

Fact Check: Claim-by-Claim Verification Verified

All 12 claims verified as Supported or Mostly Supported. No incorrect or misleading claims found.

1 Supported
Prime number theorem proved by Hadamard and de la Vallée-Poussin in 1896
2 Supported
Riemann proposed hypothesis in 1859, six-page paper
3 Supported
Only paper on number theory
Widely documented in mathematical history sources.
4 Supported
Appeared on both Hilbert's 1900 list and Millennium Prize list
5 Supported
Only problem on both lists
Confirmed by multiple mathematical references.
6 Supported
Clay Institute offers $1 million
7 Supported
Zeta function defined by sum of 1/n^s
Confirmed by Wolfram MathWorld.
8 Supported
Trivial zeros at negative even integers
Confirmed by Wolfram MathWorld.
9 Supported
Gourdon 2004 verified first 10 trillion zeros
Confirmed by Wolfram MathWorld.
10 Supported
Hardy 1914 proved infinitely many zeros on critical line
Confirmed by Harvey Mudd College.
11 Supported
Montgomery 1973 discovered random matrix connection, Dyson recognized it
Well-documented in mathematical literature.
12 Supported
Levinson 1974 showed at least one-third of zeros on critical line
Confirmed by mathematical references.

Sources used for verification

Share
Related Articles
AI In Science Connects the Dots, But Only In Fields That Are Fragmented

An analysis of 80 million papers shows AI boosts originality where knowledge is scattered and connections are weak, but contributes little novelty in structured science.

"Keep Humanity Safe From AI," Urges Pope Leo XIV

Pope Leo XIV's first encyclical reaches the same verdict on AI as the labs building it, then parts ways over the meaning of human limits.

AI Solves Erdős Math Problem: What's Next for AI in Mathematics?

An AI solved an 80-year-old Erdős math problem by walking a path mathematicians had collectively avoided.

Is AI Making You Dumber? Not If You Challenge It

Cognitive debt is the cost of letting AI think for you. New research shows the difference between healthy and harmful AI use comes down to one habit.