OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Proof of Bertrand's postulate

 Home Mathematics Fields of mathematics Arithmetic Numbers Prime numbers
 0 By others on same topic  0 Discussions  1970-01-01  See my version
Bertrand's postulate, also known as Bertrand's theorem, states that for any integer \( n > 1 \), there exists at least one prime number \( p \) such that \( n < p < 2n \). In simple terms, the theorem asserts that there is always at least one prime number between any number \( n \) and its double \( 2n \).

 Ancestors (6)

  1. Prime numbers
  2. Numbers
  3. Arithmetic
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook