The Pattern That Was True a Trillion Times — And Still False
Every checked value obeyed the boundary. Then mathematicians proved a violation must exist somewhere they still cannot see.
The Mertens conjecture looked almost impossibly convincing: every computed value of the Mertens function stayed inside a simple square-root boundary. Yet in 1985 Andrew Odlyzko and Herman te Riele proved the conjecture false without…
▶ Watch Documentary
Synopsis
The Mertens conjecture looked almost impossibly convincing: every computed value of the Mertens function stayed inside a simple square-root boundary. Yet in 1985 Andrew Odlyzko and Herman te Riele proved the conjecture false without finding a single counterexample. This documentary follows Franz Mertens’s 1897 computations, the Möbius function’s prime-driven oscillations, lattice reduction and the hidden influence of Riemann-zeta zeros—ending with a counterexample known to exist but still never explicitly seen.
Why This Matters
Few stories show the difference between evidence and proof as sharply as the Mertens conjecture. It survived hand calculations, desk calculators and enormous computer searches before mathematics proved that a violation must exist somewhere beyond the verified range. The story links prime factorization, the Möbius and Mertens functions, the Riemann zeta function, LLL lattice reduction and modern computation, while showing how a theorem can establish the existence of an object that nobody has actually located.
Life & Journey
Stieltjes Discusses a Related Bound in a Letter
Mertens Publishes Values Through 10,000
Von Sterneck Extends Computations to Five Million
Jurkat Disproves Von Sterneck's Stronger Bound
Neubauer Reports Large-Scale Mertens Computations
Odlyzko and te Riele Disprove the Mertens Conjecture
Pintz Gives an Effective Upper Bound for a Counterexample
Hurst Computes the Mertens Function Through 10^16
Rozmarynowycz and Kim Lower the Upper Bound
Kim and Nguyen Improve the Upper Bound to exp(1.96 × 10^19)



