The Riemann hypothesis is a guess about prime numbers, the numbers that divide only by themselves and one. There are 25 primes up to 100 and 168 up to 1,000. They look scattered, with gaps that grow and shrink with no clear rhythm. Bernhard Riemann suggested in 1859 that there is a deep order underneath.
He tied the primes to something called the zeta function. Certain inputs make that function equal zero, and those inputs are called zeros. The hypothesis says every one of the interesting zeros sits on a single vertical line, where the real part of the input equals one half. If that is true, the primes are spread out about as evenly as they possibly could be, and estimates of how many primes exist below any number can only miss by a small, known amount.
Computers have already checked the first ten trillion zeros, and all of them sit on the line. That is not a proof. One zero off the line, anywhere past the checked range, would sink the whole idea, which is why mathematicians want an argument that covers every case at once.
The stakes inside math are large. Thousands of results in number theory have been proved only on the assumption that the hypothesis is true. It is one of the seven Millennium Prize Problems, and the Clay Mathematics Institute has a $1 million reward waiting for a correct proof.