Quasi-Riemann Hypothesis
A prime is a whole number above 1 that only 1 and itself divide, such as 2, 3, 5, 7 and 11. Primes become rarer as numbers grow. There are 25 primes up to 100 and 168 up to 1,000. There are 78,498 up to one million.
A good formula estimates how many primes lie up to any number . It is called . For one million it gives 78,628, so it is off by only 130. The question is how far off this estimate can be for huge numbers.
The answer depends on the Riemann zeta function. A function is a rule that gives an output for each input. The zeta function starts with this sum, which has one term for each whole number:
The symbol is the Greek letter zeta, and the dots mean that the sum never ends. For , the terms are 1, , , and so on, and their sum approaches about 1.645.
Mathematicians also know how to give this function a meaning for other inputs, including complex numbers. A complex number has the form , where . It is a point on a flat map, with across and up. The number is its real part.
A zero of the function is an input that gives the output 0. There are easy zeros at , , and so on. All the others lie in a narrow band, where the real part is between 0 and 1. The figure shows this band.
Bernhard Riemann showed that these zeros control the error in the prime count. Each zero adds a wave to the error. The farther right the zero sits, the bigger its wave. Call the real part of a zero , the Greek letter beta. That zero gives a wave of size about . So the zero farthest to the right sets the size of the error.
Here is the scale when is one million. If , then is the square root of , which is 1,000. If , then is about 178,000. If is close to 1, the wave is nearly one million, about as large as itself.
The Riemann hypothesis says that every zero in the band has real part exactly . That would make the error about as small as possible. Computers have confirmed this for the first 12 trillion zeros, but nobody has a proof for all of them.
The quasi-Riemann hypothesis asks for much less. It says only that the zeros stay away from the right edge. Some fixed line left of real part 1 has no zeros to its right. Even this was unknown. Zeros very high up in the band could still sit closer and closer to the edge.
OpenAI reports a proof with the line at . A symmetry of the function then also clears the left side, below . The error in the prime count is then not much larger than .
The same limit holds for related functions that count primes in groups, such as primes that end in 7. Up to one million, the counts for the endings 1, 3, 7 and 9 are 19,617, 19,665, 19,621 and 19,593. The new result limits how uneven such counts can become. The Riemann hypothesis itself stays open.