Prove the "Chebyshev's theorem"

1.3k Views Asked by At

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

1

There are 1 best solutions below

0
On

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.