Between $n$ and $2n$ there is always a prime number.

172 Views Asked by At

Between $n$ and $2n$ there is always a prime number.

I was thinking of this and looked it up on the google to find that this is true. Now, I am wondering what is the proof for it? Does any elementary proof exist for it?

Thank you.

1

There are 1 best solutions below

3
On

Yes, many elementary proofs are known. Apart from the the original proof of Chebyshev's theorem, have a look at the Erdos' elementary proof - you can find it also in Proofs from THE BOOK.