Proof: For $k\in \mathbb{Z}: \lim\limits_{n\to\infty}\sqrt[n]{n^k}=1$
Proof:
Observe $k=1$. Then $\lim\limits_{n\to\infty}\sqrt[n]{n}=1$. Let $c_n:=\sqrt[n]{n}-1$, then: $$\begin{gather} n=(1+c_n)^n>1+\begin{pmatrix}n \\ 2 \end{pmatrix}c_n^2 \Longrightarrow n-1>\frac{n(n-1)}{2}c_n^2 \Longrightarrow c_n<\sqrt{\frac{2}{n}} \Longrightarrow \lim\limits_{n\to\infty}c_n=0 \quad \Box \end{gather}$$
I don't understand the first step with Bernoulli's inequality - why $\begin{pmatrix}n \\ 2 \end{pmatrix}$?
Secondly, I don't understand why $n-1>\frac{n(n-2)}{2}c_n^2$ implies $c_n<\sqrt{\frac{2}{n}}$...
Any ideas?
It is well known that
$$(x+1)^n = x^n + \binom{n}{n-1} x^{n-1}+\binom{n}{n-2}x^{n-2}+...+\binom{n}{2}x^2+\binom{n}{1}x+1$$
Since every term is positive we have $(c_n+1)^n>1 + \binom{n}{2} c_n^{2}$.
For your second question
$$n-1>\frac{n(n-2)}{2}c_n^2\Rightarrow c_n^2<\frac{2(n-1)}{n(n-2)}$$
Now there's a mistake since $n-1>n-2$ you can't conclude that $$c_n^2<\frac{2(n-1)}{n(n-2)}<\frac{2}{n}$$ See @auscrypt answer for a just as good result.
Edit: It seems like there's a much easier way to do that. Using the arithmetic of limits we have that
$$\lim_{n\rightarrow\infty} \sqrt [n]{n^k} = \lim_{n\rightarrow\infty} (\sqrt[n]{n})^k =(\lim_{n\rightarrow\infty} \sqrt[n]{n})^k= 1^k =1$$