Bertrand’s conjecture

Bertrand conjectured that for every positive integer n>1, there exists at least one prime p satisfying n<p<2n. This result was proven in 1850 by Chebyshev, but the phrase “Bertrand’s Conjecture” remains in the literature.

Title Bertrand’s conjecture
Canonical name BertrandsConjecture
Date of creation 2013-03-22 11:46:56
Last modified on 2013-03-22 11:46:56
Owner KimJ (5)
Last modified by KimJ (5)
Numerical id 13
Author KimJ (5)
Entry type Theorem
Classification msc 03B05
Classification msc 03B10
Classification msc 11N05
Synonym Bertrand’s postulate