Bertrand's postulate states that for all natural numbers $n>1$, there exists a prime number $p$ such that $n < p < 2n$. A proof first given by Paul Erdos will be derived for this remarkable theorem.