# How to calculate the limit of $(n+1)^{\frac{1}{n}}$ as $n\to\infty$

How to calculate the limit of $(n+1)^{\frac{1}{n}}$ as $n\to\infty$?

I know how to prove that $n^{\frac{1}{n}}\to 1$ and $n^{\frac{1}{n}}<(n+1)^{\frac{1}{n}}$. What is the other inequality that might solve the problem?

-

Why not use the value of $\lim \bigl[(n+1)/n\bigr]^{1/n}$? – Lubin Sep 5 '12 at 0:26

## 3 Answers

With $$y=\lim_{n\to\infty} (n+1)^{1/n},$$ consider, using continuity of $\ln$, $$\ln y=\lim_{n\to\infty} \frac{1}{n}\ln(n+1)=0.$$ This tells you that your limit is $1$.

Alternately, $$n^{1/n}<n^{1/n}\left(1+\frac{1}{n}\right)^{1/n}<n^{1/n}\left(1+\frac{1}{n}\right),$$ where the middle guy is your expression.

-

I would prefer a proof that not involves other concepts but convergence of know sequences. – Jön Sep 4 '12 at 22:34

For the other inequality, you could use $$(n+1)^{\frac1n}\leq (2n)^{\frac1n}=2^{\frac1n}\,n^{\frac1n}.$$

-

What about $n^{1/n}\lt (n+1)^{1/n}\le (2n)^{1/n}=2^{1/n}n^{1/n}$, then squeezing.

Or else, for $n \ge 2$, $$n^{1/n}\lt (n+1)^{1/n}\lt (n^2)^{1/n}=(n^{1/n})(n^{1/n}).$$ Then we don't have to worry about $2^{1/n}$.

-
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 12, "mathjax_display_tex": 5, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9507782459259033, "perplexity_flag": "head"}