In Hardy & Wright's Theory of Numbers (p. 494f in 6th ed.) there's a little discussion following the proof of the prime number theorem.
We have $$ \pi(2x) - \pi(x) = \frac{x}{\log x} + o\left(\frac{x}{\log x}\right) \sim \pi(x). \tag{1} $$ Thus, to a first approximation, the number of primes between $x$ and $2x$ is the same as the number less than $x$. At first sight this is surprising, since we know that primes near $x$ 'thin out' (in some vague sense) as $x$ increases. In fact, $\pi(2x) - 2\pi(x) \to \infty$ as $x \to \infty$ (though we cannot prove this here), but this is not inconsistent with (1), which is equivalent to $$ \pi(2x) - 2\pi(x) = O(\pi(x)). \tag{2} $$
Isn't this just plain wrong? First of all, (1) is not equivalent to (2) but rather to $$ \pi(2x) - 2\pi(x) = o(\pi(x)). \tag{2'}$$ More importantly, how can $\pi(2x) - 2\pi(x)$ go to infinity if $\pi(2x) < 2\pi(x)$ for $x \ge 11$?
Thus the question is, as $x \to \infty$, what is $\pi(2x) - 2\pi(x)$ actually doing?