# Check whether or not $\sum_{n=1}^{\infty}{1\over n\sqrt[n]{n}}$ converges. [duplicate]

Check whether or not $\sum_{n=1}^{\infty}{1\over n\sqrt[n]{n}}$ converges.

I tried few things but it wouldn't work out. I would appreciate your help.

• Did you try taking advantage of the fact that $\lim\limits_{n\rightarrow\infty} \root n\of n=1$? – David Mitra Jan 30 '15 at 20:04
• Shouldn't it be $limsup$? And yes I tried, but then I thought that $lim$ don't take the supremum but what it gets when $n$ tends to infinity. – Meitar Abarbanel Jan 30 '15 at 20:05
• @MeitarAbarbanel $\limsup=\lim$ when the limit exists. – Adam Hughes Jan 30 '15 at 20:07
• I think this series compares with $\sum \frac1{n \log{n}}$. – Ron Gordon Jan 30 '15 at 20:16
• @RonGordon yes, if you show $\sqrt[n]{n}\le M$ ($M=2$ is easy enough) then you can compare with that one. – Adam Hughes Jan 30 '15 at 20:19

## 3 Answers

$\require{cancel}$

Using the limit comparison test with the harmonic series we see

$$\lim_{n\to\infty} {\cancel{(1/n)}\cdot 1\over \cancel{(1/n)}\sqrt[n]{n}}=1$$

hence the series diverges since the harmonic series does.

• Thank you! I have been trying to do this and somehow didn't manage to. – Meitar Abarbanel Jan 30 '15 at 20:09
• I meant to write the comment under the main question. Shifting. – André Nicolas Jan 30 '15 at 20:18

Since $\lim_{n\to\infty}\sqrt[n]n=1$ then for sufficiently large $n$ we have

$$\frac1{n\sqrt[n]n}\ge \frac1{2n}$$ Can you take it from here?

• Shouldn't it be $\ge {1\over n}$ from some point? – Meitar Abarbanel Jan 30 '15 at 20:08
• Doesn't this hold for all $n\in\mathbb{R^+}$? – Lukas Juhrich Jan 30 '15 at 20:09
• @MeitarAbarbanel no, $\sqrt[n]{n}>1$ for all $n\in\Bbb N$. – Adam Hughes Jan 30 '15 at 20:10
• But from some point $n\sqrt[n]{n}$ is strictly smaller then $2n$... – Meitar Abarbanel Jan 30 '15 at 20:11
• In this case $1$ is sufficiently large;) @Lukas – user63181 Jan 30 '15 at 20:12

$$n \cdot n^{1/n} = n e^{\log{n}/n} = n \left [ 1+ \frac{\log{n}}{n} + O\left ( \frac{\log^2{n}}{n^2} \right ) \right ] = n + \log{n}+ O\left ( \frac{\log^2{n}}{n} \right )$$

Now,for sufficiently large $n$ (i.e., $n \gt 4$), $n+\log{n} \lt n \log{n}$, so the sum is larger than

$$\sum_{n=2}^{\infty} \frac1{n \log{n}}$$

which diverges.