All problems MILLEVIZ
02 · The Riemann Hypothesis An interactive essay

Where do the primes keep their rhythm?

Count the primes up to a million and you get 78,498. Nobody can tell you why that number and not another. Something decides it, and the guess is that the decision is made somewhere else entirely.

Primes are the numbers with no factors but themselves and one. They arrive without warning: 2, 3, 5, 7, 11, then a gap, then two at once. Yet from far enough away the scatter has a shape, and the shape is startlingly regular. The Riemann Hypothesis is a claim about how regular.

The claim
Every nontrivial zero of the Riemann zeta function has real part exactly one half. Stated in 1859. Checked for the first ten trillion zeros. Proved for none of them.

01  |  The count

Primes thin out, on schedule.

Write down how many primes there are below each number and you get a staircase. It never stops climbing, but the steps get further apart. Gauss noticed as a teenager that the height of the staircase is close to a smooth curve, and that curve involves nothing but a logarithm.

Primes below x, counted and estimatedFig. 01

The staircase is the true count. The dashed line is Gauss's first guess, x divided by its logarithm. The solid gray line is the better one, the logarithmic integral, and it hugs the staircase closely enough that the difference is the whole subject.

02  |  The error

The good guess is always a little wrong.

Subtract the staircase from the smooth curve and you are left with the error. It wanders. The question is not whether it is zero; it is how far it can stray. Riemann's claim, translated out of its own language, sets a ceiling: the error never grows faster than the square root of x, give or take a logarithm.

Li(x) − π(x), against a √x envelopeFig. 02

The envelope opens as √x. The error crawls along the floor of it and, over this whole range, never once dips below zero: Li(x) always overshoots. The first time it undershoots is somewhere past 10 to the power 316, a number nobody will ever reach by counting. The error has to stay inside the envelope forever, at every scale, for the hypothesis to hold. No computation can settle that; only a proof can.

03  |  The zeros

Everything sits on one line.

Riemann moved the question somewhere unexpected. He built a function of a complex number, the zeta function, and showed that the error in the prime count is controlled entirely by the places where that function equals zero. Those places live in a vertical strip. Every one found so far sits dead center, on the line where the real part is one half.

The first 50 nontrivial zeros in the critical stripFig. 03

The first zero sits at t = 14.13. Point at any dot to read its height. The tick marks below record where the rest fall. More than ten trillion have been computed and not one has left the line. The hypothesis says none ever will.

04  |  The music

Each zero is a wave. Add enough and the primes appear.

This is the part that is hard to believe the first time. Every zero contributes one wave, and the sum of those waves reproduces the staircase of the primes exactly. Start with a straight line. Add the first zero and a ripple appears. Add fifty and the steps sharpen into place. The primes are not hiding a pattern; they are the pattern, heard from the other side.

The prime staircase ψ(x), rebuilt from zerosFig. 04 · Interactive
Zeros included50
20
Waves in the sum

Gray is the true staircase, which jumps by log p at every prime and every prime power. Colored is the explicit formula with the chosen number of zeros. This is Chebyshev's ψ(x) rather than the prime count itself, because its formula is the clean one, and the formula converges to the middle of each riser rather than its top, which is why the curve threads through the steps instead of tracing them.

05  |  What hangs on it

Thousands of theorems begin with the word if.

Number theory is full of results whose first line assumes the Riemann Hypothesis. If a zero were ever found off the line, the waves would fall out of step and the primes would clump in a way nothing currently predicts. Much of what is believed about factorization, and so about the cryptography built on it, would need rewriting. Nobody expects that. Everybody would like to know.

It has stood since 1859. Hilbert put it on his list in 1900. Clay put a million dollars on it in 2000. It remains, by most accounts, the most important open question in mathematics.

Read the equation
ζ(s) = ∑n ≥ 1 1 / ns = ∏p prime (1 − p−s)−1

The sum on the left runs over every whole number; the product on the right runs over every prime. Euler proved they are the same thing, and that single identity is the bridge the whole subject crosses. The sum converges only when the real part of s exceeds one, so ζ is extended to the rest of the plane by analytic continuation. The zeros at s = −2, −4, −6 and so on are called trivial and are not at issue. Every other zero is.

Behind the visuals

Figures 01 and 02 count primes by sieve and integrate Li(x) numerically from 2. Figure 03 plots the imaginary parts of the first fifty zeros at their published values, starting at 14.134725 and ending at 143.111846. Figure 04 evaluates the explicit formula ψ(x) = x − ∑ xρ/ρ − ln 2π − ½ln(1 − x−2), pairing each zero with its conjugate so the sum stays real. The staircase behind it jumps by ln p at every prime power.