I have seen this problem in a book .
But I don't know what should be the solution . Question is
There is a sequence defined by $$\sqrt[1]{1},\sqrt[2]{2},\sqrt[3]{3},\sqrt[4]{4},\cdots,\sqrt[n-1]{n-1},\sqrt[n]{n}$$
We have to find the largest number in this sequence.
What I did is as usual what I do when comparing two irrational numbers
I compared $\sqrt[1]{1} $ & $\sqrt[2]{2}$ and found that $\sqrt[2]{2}$ is greater.
Then I compared $\sqrt[3]{3} $ &$\sqrt[2]{2}$ and found $\sqrt[3]{3}$ is greater.
Then I compared $\sqrt[3]{3} $& $\sqrt[4]{4}$ and found $\sqrt[3]{3}$ is greater.
And then I compared $\sqrt[5]{5}$&$\sqrt[4]{4}$ and found $\sqrt[4]{4}$ is greater.
And finally I compared $\sqrt[5]{5}$&$\sqrt[6]{6}$ and found $\sqrt[5]{5}$ is greater.
I cannot guarantee will it work up to infinity or not and found $\sqrt[3]{3}$ is greatest term.
And now I have to prove my result.
More generally I have to prove that $\sqrt[n]{n}\gt \sqrt[n+1]{n+1}$ for all $n\in\mathbb N$ and $n\gt 2$
I applied induction to prove it but didn't got the solution.
Please help me in proving this .
Or please tell me an alternative way to tell which number is largest in the sequence.
Notice that your inequality is equivalent to $$ n^{n+1} > (n+1)^n = \sum_{k=0}^{n} {n \choose k} n^{n-k}. $$ Now, the sum on the right has $n+1$ terms. A simple upper bound for a generic term is $$ {n \choose k} n^{n-k} \le \frac{n^k}{k!} n^{n-k} = \frac{n^n}{k!}.$$ Thus, we have $$ (n+1)^n \le n^n(1 + 1 + \frac1{2!} + \ldots + \frac1{n!}) \le n^n \cdot e. $$ Using that for $n \geq 3$ we have also $n > e$, we get $(n+1)^n < n^n \cdot n = n^{n+1}.$