The proof creates stricter limits on potential exceptions to the famous Riemann hypothesis.
Sometimes mathematicians try to tackle a problem head on, and sometimes they come at it sideways. That’s especially true when the mathematical stakes are high, as with the Riemann hypothesis, whose solution comes with a $1 million reward from the Clay Mathematics Institute. Its proof would give mathematicians much deeper certainty about how prime numbers are distributed, while also implying a host of other consequences — making it arguably the most important open question in math.
Mathematicians have no idea how to prove the Riemann hypothesis. But they can still get useful results just by showing that the number of possible exceptions to it is limited. “In many cases, that can be as good as the Riemann hypothesis itself,” said James Maynard of the University of Oxford. “We can get similar results about prime numbers from this.”
In a breakthrough result posted online in May, Maynard and Larry Guth of the Massachusetts Institute of Technology established a new cap on the number of exceptions of a particular type, finally beating a record that had been set more than 80 years earlier. “It’s a sensational result,” said Henryk Iwaniec of Rutgers University. “It’s very, very, very hard. But it’s a gem.”
The new proof automatically leads to better approximations of how many primes exist in short intervals on the number line, and stands to offer many other insights into how primes behave.
Good to see Quanta Magazine published this article about this yesterday. Nothing beats there ability at explaining complicated stuff in simple terms. Thanks for sharing, hadn't noticed it yet.
reply
I missed your post. Yes, quantamagazine explains it very well.
reply