It is well known that there is a prime number between $n$ and $2n$ for all $n$. I decided to go deeper: is there a lower bound on the number of primes between $n$ and $2n$ for "large enough" $n$?
For instance, I found empirically that $\pi(n)-\pi(n/2)\ge \sqrt n$ at around $n\ge 100$ (In particular, I also used a program to show $\pi(n^2)-\pi(n^2/2)\ge n$ for $n\ge 10$). Does there exist a nice elementary proof of this?
Obviously, we can show this result asymptotically for very great $n$. I ask to consider an elementary proof of the above bound.