language-icon Old Web
English
Sign In

Cramér's conjecture

In number theory, Cramér's conjecture, formulated by the Swedish mathematician Harald Cramér in 1936, is an estimate for the size of gaps between consecutive prime numbers: intuitively, that gaps between consecutive primes are always small, and the conjecture quantifies asymptotically just how small they must be. It states that In number theory, Cramér's conjecture, formulated by the Swedish mathematician Harald Cramér in 1936, is an estimate for the size of gaps between consecutive prime numbers: intuitively, that gaps between consecutive primes are always small, and the conjecture quantifies asymptotically just how small they must be. It states that where pn denotes the nth prime number, O is big O notation, and 'log' is the natural logarithm. While this is the statement explicitly conjectured by Cramér, his heuristic actually supports the stronger statement

[ "Prime k-tuple", "Elliott–Halberstam conjecture", "Lonely runner conjecture", "Goldbach's weak conjecture", "abc conjecture" ]
Parent Topic
Child Topic
    No Parent Topic