Partial sums of $\sum_{x=1}^n \frac{1} {x \log(x)}$?

Question

I am interested in getting more precise partial sums for $$\sum_{x=1}^n \frac{1} {x \log(x)}$$ I understand that this series will diverge as $n \to \infty$. I've only been able to get a rough estimate for a lower bound based on PNT. Using PNT I can deduce that $p_n$ ~ $n \log(n)$. Using Rosser's Theorem I know that $p_n > n\log(n)$. I've looked into it and found: $\sum_{x=1}^n \frac{1} {x \log(x)}$ ~ $\sum_{x=1}^n \frac{1} {p_x} \approx H_n$ ~ $\log(n)$. With this I know that $\sum_{x=1}^n \frac{1} {x \log(x)} > \log(n)$ because it is the sum of their reciprocals and the nth harmonic $H_n - \log(n) = \gamma$ as $n \to \infty$. I did find an old forum post on a similar question about specifically primes: $\sum_{x=1}^n \frac{1} {p_x \log(p_x)}$ but it proved to be inconclusive. I am interested if there is an asymptotic function with some error that better approximates partial sums. I'm looking to graph sums. I know Taylor Series could help but I'm looking for something more succient if possible.

Answer 1

First, note that $\log 1 = 0$ hence as written your sum is infinite. So let us instead consider the sum with lower index at $2$, i.e. $$S(n) = \sum_{x=2}^n \frac{1}{x \log x}.$$ Since $f(x) = 1/(x \log x)$ is convex on $x > 1$, we find that $$S(n) > \int_{x=2}^n \frac{dx}{x \log x} = \log \left(\frac{\log n}{\log 2}\right).$$ This lower bound can be improved using the trapezoidal rule, namely $$S(n) > \frac{1}{2}\log \left(\frac{\log n \log (n+1)}{\log 2 \log 3}\right).$$ Since the error is largest for small $n$, we could do still better by summing the first few terms exactly, then using the relationship $$\sum_{x=m}^n \frac{1}{x \log x} > \log \left(\frac{\log n}{\log m}\right), \quad n > m \gg 1.$$