0

I am working on an exercise, at the end of which I need to show

$$\sum_{k=1}^{\infty}\dfrac{1}{k(\log k)^{1+\epsilon}}<\infty,\ \text{for}\ \epsilon>0\ \text{fixed}.$$

It is natural to try to get an upper bound of this series which converges, and as $k\geq 1$, we must have $$k(\log k)^{1+\epsilon}\geq (\log k)^{1+\epsilon},$$ and thus $$\sum_{k=1}^{\infty}\dfrac{1}{k(\log k)^{1+\epsilon}}\leq \sum_{k=1}^{\infty}\dfrac{1}{(\log k)^{1+\epsilon}},$$ but how could I show the latter series converges? does this series even make sense (since we have singularity at $k=1$)?

Thank you!

1 Answers1

2

For $L > 1$, $\frac{1}{k \ln^{1+\varepsilon}k}$ is a positive, monotonically decreasing function on $[L,\infty)$, so we may apply the integral test. Using the substitution $u = \ln k$,

$$ \int_L^\infty \frac{\mathrm{d}k}{k \ln^{1+\varepsilon}k} = \frac{1}{\varepsilon \ln^{\varepsilon} L} $$

is finite, so $$ \sum_2^\infty \frac{1}{k \ln^{1+\varepsilon}k} $$ converges.

Eric Towers
  • 70,953