PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Medium Entry average rating: High
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)

View style:

Other names:  Bertrand's postulate
Keywords:  number theory

Attachments:
proof of Bertrand's conjecture (Proof) by CWoo
Log in to rate this entry.
(view current ratings)

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 6358 times total.

Classification:
AMS MSC11N05 (Number theory :: Multiplicative number theory :: Distribution of primes)

Pending Errata and Addenda
None.
[ View all 5 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | prove | add result | add corollary | add example | add (any)