Prove the "Chebyshev's theorem"

Question

I know the Chebyshev's theorem for primes that is : There is a $p$ between $n, 2n$ if $n>1$ Can you prove it easily? Actually I'm just 13 years old and I couldn't find an answer that I can understand. Thanks

There aren't any known easy proofs - it is surprisingly hard to prove. The most "basic" proofs still require a bit of math that most 13-year-olds haven't seen yet. — Thomas Andrews, Jan 30 '16 at 17:02
No, because it is very long and it can be found elsewhere. https://en.wikipedia.org/wiki/Proof_of_Bertrand%27s_postulate — Thomas Andrews, Jan 30 '16 at 17:05
I advise you to grab a copy of "Proofs from THE BOOK". The proof is carried out there in a relatively easy way, and every result used is proved. — Ruben, Jan 30 '16 at 17:18

score 1 · Answer 1 · answered Oct 27 '16 at 00:32

I am fairly confident in saying that the answer is no, no there is not an easy proof of this. Incase, you are still interested, the only thing that I could find (for those of us who don't speak German) is here. This probably won't help you, and the lemmas aren't explained (not much is explained at all really), but it might give you a general sense for what the proof looks like. The original (in German) is cited at the bottom of the page, and I haven't personally gone through this proof to see if any mistakes are made.

Prove the "Chebyshev's theorem"

1 Answers1