Let $N_k$ denote the $k-th$ primorial number. That is, the product of the first $k$ primes and $\phi(n)$ be the Euler totient function.
How can one show that there exists a constant $\theta>1$ such that $\dfrac{N_k}{\phi(N_k)} > \theta \log\log N_k$
My attempt: By Mertens' theorem, we know that $\theta \to e^{\gamma}$, hence it seems to follow that for sufficiently large $k$, we can take any $1<\theta<e^{\gamma}$ ?
In this question, the sign $''\to''$ was used to mean ''tends to'', as an example, for the Prime Number Theorem we write $\pi(x) \to \frac{x}{\log x}$, where $\pi(x)$ is the prime counting function, but obviously this is not the correct symbol, unfortunately, i'm yet to learn how to write it in MathJax. Any editing to the correct format will therefore be most welcome.