|
|
|
|
Bertrand's conjecture
|
(Theorem)
|
|
|
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.
|
"Bertrand's conjecture" is owned by KimJ.
|
|
(view preamble | get metadata)
| Other names: |
Bertrand's postulate |
|
|
Cross-references: prime, integer, positive
There are 5 references to this entry.
This is version 8 of Bertrand's conjecture, born on 2001-10-16, modified 2006-10-26.
Object id is 251, canonical name is BertrandsConjecture.
Accessed 7845 times total.
Classification:
| AMS MSC: | 11N05 (Number theory :: Multiplicative number theory :: Distribution of primes) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|
