Is there some elementary proof for Bertrand's Postulate for n is prime

102 Views Asked by At

Let $p_n$ be the sequence of primes.

$p_n<2p_{n-1}$

Is there some elementary proof?