One Step Closer to the Riemann Hypothesis: The New Bound on a Famous Number
Some maths problems are so famous that they carry a million-dollar prize. The Riemann Hypothesis, first posed in 1859, is one of them — and this week mathematicians took one more small step towards it.
On 4 November 2026, Michel Planat and Dale James Raymond posted a paper on arXiv, the open archive where mathematicians share new work, announcing a tighter bound on a number called the de Bruijn–Newman constant, written as Λ (the Greek letter lambda). Their new result: Λ is less than 0.156821. That is about 22% lower than the previous best bound of 0.2, set years ago.
What is this number, and why does it matter?
The Riemann Hypothesis is a claim about the prime numbers — 2, 3, 5, 7, 11, and so on — and where a certain mathematical function, the Riemann zeta function, equals zero. It says that all the interesting zeros lie on one straight line, the "critical line". Nobody has proved it in over 160 years, despite it being one of the Clay Mathematics Institute's seven Millennium Prize Problems, each worth one million US dollars.
The de Bruijn–Newman constant is a way of measuring how far we are from a proof. Imagine slowly "heating up" the zeta function: as you do, its zeros start to move off the critical line. The constant Λ marks the exact point where the last zero leaves the line. The Riemann Hypothesis is true exactly when Λ is zero or below — so every time mathematicians push the known upper bound on Λ closer to zero, they are squeezing the room in which a counterexample could hide. The new bound of 0.156821 does not prove the hypothesis, but it narrows the gap further than ever before.
How did they do it?
The proof is computer-assisted. The authors built a method that rules out "collisions" — places where two zeros could meet and slip off the line — using a certificate built from 664,505 structural Fourier coefficients, 44,182 closed boxes in a mathematical space, and thousands of other checked pieces. The paper also includes the computer code and data needed to reproduce the checks, so other mathematicians can verify the work themselves.
One honest note: this is a preprint, posted on 4 November 2026, and it has not yet been peer-reviewed. The authors themselves distinguish their unconditional claim from other recent, not-yet-refereed computational bounds on the same constant. The maths community will now read it, run the code, and probe the argument — that careful checking is part of how mathematics works.
Why students should care
This is a story about patience and precision. The bound on Λ has been inching downwards for decades: from 0.5, to 0.2, and now to 0.156821. Nobody knows whether the next step will come from a clever new idea, a bigger computer, or a completely different approach. What is certain is that the tools involved — prime numbers, complex numbers, and careful logical argument — are the same ones students meet in school maths, just carried much further. If your child enjoys number patterns and wants to see where they lead, find a maths tutor who can show them, or explore GCSE maths resources on TES for practice material matched to the curriculum.
Book your first lesson in maths and help your child see where number patterns really lead: Book your first lesson
Curious about maths? Post a request on London Tutors and compare verified maths tutors — online, in person or in a group class.