Let $\pi, \vartheta$ be respectively the prime counting function and the first chebyshev function. As you know, $ \pi(x) \sim x/\log x$, and $\vartheta(x) \sim x$, so that, at first order, seems $\pi(x) \log x \sim \vartheta(x)$. Is it easy to state that $\pi(x) \log x > \vartheta(x)$ (just use definition of $\theta$), but my question is:
Can you find an asymptotics for $\pi(x)\log x - \vartheta(x)$?
I met it while approaching to Combinatorial Interpretation of a Certain Product of Factorials