Search criteria:

List of files deposited in CurateND that match your search criteria

• 1

  Document

  Erdos's proof of Bertrand's postulate
  

  Abstract:

  In 1845 Bertrand postulated that there is always a prime between $n$ and $2n$, and he verified this for $n < 3,000,000$. Tchebychev gave an analytic proof of the postulate in 1850. In 1932, in his first paper, Erdos gave a beautiful elementary proof using nothing more than a few easily verified facts about the middle binomial coefficient. We describe Erdos’s proof and make a few additional comments, including a discussion of how the two main lemmas used in the proof very quickly give a…

  Record Visibility:

  Public

  Title

  Erdos's proof of Bertrand's postulate

  Subject

  Mathematics

  Publisher

  Self

  Rights

  All rights reserved

  Resource Type

  Document