# Convergence of the series of terms $\frac{(\log(i))^k}{i^2}$ using the comparison test

I was wondering if someone knows a comparison test argument for the convergence of $$\sum_{i=2}^{\infty} \frac{(\log(i))^k}{i^2}$$ for all $k \gt 0$. If possible, I am particularly interested in a comparison test argument. When I put the series into Wolfram Alpha, it told me that the series converges by the comparison test, however, I cannot come up with a nice series we can compare it with.

Thanks! Lauren

(Note: $\log$ is the natural logarithm in this case)

• Can you show that if $a_n = \frac{(\ln n)^k}{n^2}$ and $b_n = \frac{1}{n^{3/2}}$, then $\frac{a_n}{b_n} \xrightarrow[n\to\infty]{} 0$? – Clement C. Oct 21 '15 at 23:15

No matter how small you take $\delta > 0,$ you always have $$\lim_{n \rightarrow \infty} \frac{\log n}{n^\delta} = 0.$$ For your $k,$ take $\delta = \frac{1}{2k}$ for example.

• Thanks for your response. I can see this intuitively, but, is there any way to show this a little more formally? – Lauren Hayes Oct 21 '15 at 23:18
• lhospitals rule – Will Jagy Oct 21 '15 at 23:18
• Apologies for the ambiguous question, I meant for all $k \gt 0$ – Lauren Hayes Oct 21 '15 at 23:19
• @LaurenHayes If you know how to prove it for $k=1$, you know it for any $k$. Indeed, just take the $k$-th root, and replace $\delta$ by $\delta/k$. – Clement C. Oct 21 '15 at 23:29

Hint One can use that $\log x$ is $O(x^{\epsilon})$, and hence $(\log x)^k$ is $O(x^{k \epsilon})$ for all $\epsilon > 0$. Thus, the summand is $O(x^{k \epsilon - 2})$, and we can choose $\epsilon$ small enough so that the sum converges.

Alternatively, we can apply the integral test; the substitution $x = \exp u$ transforms the integral to a convenient form and, using a common integral definition of the Gamma function, should give a reasonably good upper bound in terms of something like $\Gamma(k)$.

There have been several solid answers that rely on the fact that for all $\alpha >0$, $\log x=O(x^{\alpha})$. I thought it would be instructive to show this using standard tools that don't rely on L'Hospital's Rule but rather, only involve the integral definition of the log and simple inequalities.

To that end, the (integral representation) definition of the log function can be written as

$$\log x\equiv\int_1^x\frac{1}{t}\,dt$$

Therefore, for any number $\alpha>0$, however small, we have

$$\log x^{\alpha}=\int_1^{x^{\alpha}}\frac{1}{t}\,dt \tag 1$$

Now, we can easily find an upper bound for $\log x$ using $(1)$. To that end, we write

\begin{align} \alpha \log x&=\log x^{\alpha}\\\\ &=\int_1^{x^{\alpha}}\frac{1}{t}\,dt\\\\ &\le x^{\alpha}-1\\\\ &<x^{\alpha} \end{align}

whereupon dividing $(2)$ by $\alpha$ yields

$$\log x\le \frac{x^{\alpha}}{\alpha} \tag 3$$

Now, recall that $(3)$ holds for all $\alpha >0$. Then, given a number $k$, we can choose this $\alpha$ so that $\alpha k=\delta <1$. Therefore, exploiting $(3)$ we have

$$\frac{\log^k i}{i^2}\le\frac{i^{\alpha k}}{\alpha i^2}=\frac{1}{\alpha i^{2-\delta}}$$

and therefore the series $\sum_{i=1}^\infty\frac{\log^k i}{i^2}$ converges by the comparison test since $2-\delta >1$. And we are done.

• Please let me know how I can improve my answer. I really want to give you the best answer I can. - Mark – Mark Viola Nov 22 '15 at 6:24