Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Possible Duplicate:
$\lim_{n \to +\infty} n^{\frac{1}{n}} $

I know that


and I can imagine that $n$ grows linearly while $n$th root compresses it exponentially and therefore the result is $1$, but how do I calculate it?

share|cite|improve this question

marked as duplicate by Martin Sleziak, Pedro Tamaroff, Marvis, Listing, Zev Chonoles Jun 5 '12 at 16:46

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

Look at the limit of the logarithm instead: $\lim\limits_{n\to\infty}\frac1n\ln n$. What’s $\lim\limits_{x\to\infty}\frac{\ln x}x$? – Brian M. Scott Jun 5 '12 at 9:44
So the "trick" is $$a^b=e^{b*\ln{a}}$$ – Santhos Jun 5 '12 at 10:28
up vote 20 down vote accepted

Perhaps one of the most elementary ways to prove it: since $\,n\geq 1\,\,\forall n\in\mathbb{N}\,$ , we can put$$\sqrt[n]{n}=1+c_n\,,\,c_n\geq0\Longrightarrow n=(1+c_n)^n\geq \frac{n(n-1)}{2}c_n^2$$using the binomial expansion ,so that$$0<c_n\leq\sqrt\frac{2}{n-1}$$and now just apply the squeeze theorem and get $\,c_n\to 0\,$, which is precisely what we need.

share|cite|improve this answer
what is this cn?? – Santosh Linkha Jun 5 '12 at 17:28
It's a number $>0$ that depends on $n$. – Amihai Zivan Jun 5 '12 at 19:30
@experimentX: Specifically, $c_n$ by definition is $\sqrt[n]{n}-1$. It is a case of introducing notation to make the exposition easier. – Jonas Meyer Jun 6 '12 at 1:41

Claim: For each $a>1$, there exists $N$ such that $n<a^n$ for all $n>N$.

Proof: Write $a=1+b$. By the binomial theorem, $a^n=(1+b)^n\geq \frac{1}{2}n(n-1)b^2$ when $n\geq 2$. Thus $\frac{a^n}{n} \geq \frac{1}{2}(n-1)b^2$. It follows that if $N$ is at least $2/b^2+1$, then when $n>N$, $n<a^n$.

As a consequence, for each $a>1$, there exists $N$ such that $1\leq n^{1/n}<a$ for all $n>N$, and this implies that $\lim\limits_{n\to\infty}n^{1/n}=1$.

share|cite|improve this answer
DonAntonio's answer is simpler. – Jonas Meyer Jun 5 '12 at 10:54
Yes, thanks for noticing it. One of the things I've never forgotten since my late prof. in $1$st undergraduate year taught us this proof: I think I drooled for a while completely fascinated for the simplicity of the proof, compared with what several books showed. – DonAntonio Jun 5 '12 at 11:00
@DonAntonio: Inspired by your post I cleaned mine up a little (but didn't essentially change the method). – Jonas Meyer Jun 5 '12 at 11:01

$$\lim_{n\rightarrow\infty}\sqrt[n]n$$ $$=\lim_{n\rightarrow\infty}e^{\frac{\ln(n)}{n}}$$ and as we know that $\lim_{n\rightarrow\infty}\frac{\ln(n)}{n} = 0$ {apply l'Hospital's rule}
So $$\lim_{n\rightarrow\infty}\sqrt[n]n=1$$

share|cite|improve this answer

One could use the fact that for a sequence of positive terms, if $\lim\limits_{n\rightarrow\infty}{a_{n+1}\over a_n}$ exists, then so does $\lim\limits_{n\rightarrow\infty} \root n\of {a_n}$ and the two limits are equal. A proof of this general fact can be found in these notes of Pete L. Clark. This result can also be found in many analysis texts; e.g., baby Rudin.

That your sequence has limit $1$ is easily shown using the above fact. A detailed proof that your sequence has limit $1$, based on the proof of the above fact, can be found in this thread.

share|cite|improve this answer
See also here and here for the result on relation between $\frac{a_{n+1}}{a_n}$ and $\sqrt[n]{a_n}$. – Martin Sleziak Jun 5 '12 at 16:41

Let's see a very elementary proof. Without loss of generality we proceed replacing $n$ by $2^n$ and get that: $$ 1\leq\lim_{n\rightarrow\infty} n^{\frac{1}{n}}=\lim_{n\rightarrow\infty} {2^n}^{\frac{1}{{2}^{n}}}=\lim_{n\rightarrow\infty} {2}^{\frac{n}{{2}^{n}}}\leq\lim_{n\rightarrow\infty} {2}^{\frac{n}{\dbinom{n}{2}}}=2^0=1$$

By Squeeze Theorem the proof is complete.

share|cite|improve this answer
what did you do near the last step?? – Santosh Linkha Jun 5 '12 at 17:27
@experimentX: consider the fact that $2^n$ is the sum of binomial coefficients for given n. Then you take all all the terms away except that one and get an useful inequality. See here: – user 1618033 Jun 5 '12 at 17:32
I understand that ... thanks !! – Santosh Linkha Jun 5 '12 at 17:34
@experimentX: you're welcome! – user 1618033 Jun 5 '12 at 17:36

Let$$y=n^{\frac{1}{n}}$$ $$\log y=\log( n^{\frac{1}{n}})$$ $$\Rightarrow \lim_{n\to\infty}\log y=\lim_{n\to\infty}\frac{\log n}{n}$$ We have $\left(\frac{\infty}{\infty}\right)$ form so we apply L'hospital rule, we get, $$ \lim_{n\to\infty}\log y=\lim_{n\to\infty}\frac{\frac{1}{n}}{1}$$ $$\therefore \lim_{n\to\infty}\log y=\lim_{n\to\infty}\frac{1}{n}=0$$ Hence $$\lim_{n\to\infty} y=e^{0}=1.$$ It follows that, $$\lim_{n\to\infty}n^{\frac{1}{n}}=1.$$

share|cite|improve this answer

Not the answer you're looking for? Browse other questions tagged or ask your own question.