Give an integer $a \ge 1$, does the Prime Number Theorem imply for large enough $x$ that:
$$(a+1)\pi(ax) \ge a\pi((a+1)x)$$
where $\pi(x)$ is the prime counting function.
Using the formula of Pierre Dusart found here for $x > 598$:
$$\left(\frac{x}{\log x}\right)\left(1 + \frac{0.992}{\log x}\right) \le \pi(x) \le \left(\frac{x}{\log x}\right)\left(1 + \frac{1.2762}{\log x}\right)$$
this is true for $a=1$.
Given a large enough $x$, could it possibly be true for all $a$?
Edit: Changed [] to () to avoid any confusion based on a question received in the comments.
Just use that $$ \pi (x) = \frac{x}{\log x} + O \left( \frac{x}{\log^3 x} \right) $$ (we can have more logs in the denominator of the error if we like). We thus have that $$ (a+1) \pi (ax) - a \pi ((a+1) x) $$ is roughly $$ \frac{ax}{\log^2 (ax)} $$ with error of order, at most, say, $$ O \left( \frac{a^2 x}{\log^3 (ax)} \right). $$ Taking $x$ suitably large relative to $a$ thus guarantees that the desired inequality holds.