We know that $\sum \frac{1}{n^p}$ is convergent for $p>1$. However the series $\sum {\frac{1}{n^{1+1/n}}}$ is apparently divergent since $1+1/n$ tends to 1 as $n$ tends to infinity. But how to prove this? The root test fails expectedly and I haven't been able to find a smaller divergent series for comparison test.
2026-04-04 09:07:43.1775293663
On
How can we prove $\sum {\frac{1}{n^{1+1/n}}}$ is divergent?
20.1k Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
3
There are 3 best solutions below
0
On
HINT
$1$. Prove that $\displaystyle \sum_n \dfrac1{n \log n}$ diverges using the fact that if we have a monotone decreasing sequence, then $\displaystyle \sum_{n=2}^{\infty} a_n$ converges iff $\displaystyle \sum_{n=2}^{\infty} 2^na_{2^n}$ converges
$2$. Prove that $\log n > n^{1/n}$ eventually and hence $$\dfrac1{n^{1/n}} > \dfrac1{\log n}$$
$3$. Conclude what you want.
Note that $n^{1/n} \lt 2$ for all $n$, for it is easy to show that $n \lt 2^n$. One can do this by induction, or by using the Binomial Theorem on $(1+1)^n$, or in several other ways.
It follows that $\dfrac{1}{n^{1+1/n}}\gt \dfrac{1}{2n}$.