Show there exists a $K > 0$ such that for all $x> K$ the interval $]x,2x]$ contains fewer primes than the interval $[0,x]$.
My approach so far has been to try to show $\pi(2x)-2\pi(x)$ is negative for all $x>K$ as this would be the desired conclusion. My idea is to apply the Prime Number Theorem, but so far I have not been able to do it in a fruitful way.
I would appreciate any help or hints for this problem. Thanks!