Bertrand's Postulate: Difference between revisions
ComplexZeta (talk | contribs) No edit summary |
mNo edit summary |
||
| Line 1: | Line 1: | ||
'''Bertrand's postulate''' states that for any [[positive integer]] <math>n</math>, there is a [[prime number|prime]] between <math>n</math> and <math>2n</math>. | '''Bertrand's postulate''' states that for any [[positive integer]] <math>n</math>, there is a [[prime number|prime]] between <math>n</math> and <math>2n</math>. Despite its name, it is in fact a theorem. | ||
{{stub}} | {{stub}} | ||
Revision as of 12:26, 29 June 2006
Bertrand's postulate states that for any positive integer
, there is a prime between
and
. Despite its name, it is in fact a theorem.
This article is a stub. Help us out by expanding it.