Prime gap comparison shows Riemann is far weaker than Cramér's O(log²n) prediction

geoffreyirving · x · 2026-11-21

Amid the Riemann proof buzz, geoffreyirving notes the cleanest illustration that Riemann is weak relative to what's probably true: it only bounds maximal prime gaps at O(√n log n), while reasonable random models of the primes (Cramér's conjecture) suggest O(log² n).

Related event: DeepMind researcher asks what comes after Riemann — number theorists have no answer(8 posts)→

Original post →

More from Research

Research channel →