# Thread:

1. ## Convergence

I have attached the question.

I have expanded $(1+h)^n$ using the binomial theorem, and the question after it I assume they want me to use the very same theorem to prove the convergence.

So this is what I had done;

$(n+1)^{1/n}=1+h \rightarrow n+1=(1+h)^n=1+nh+\frac{n!}{2!(n-2)!}+...+h^n$

I'm not sure how to prove convergence from then on, but I am guessing the Sandwich Rule would need to be used here at one point.
Any hints/tips?
Attached Thumbnails

2. ## Re: Convergence

Let $h_n$ be such that $(n+1)^{1/n}=1+h_n$. From what you wrote, $1+nh_n+n(n-1)/2\cdot h_n^2<1+n$, so...

3. ## Re: Convergence

I understand how you derived the above inequality, however I'm not sure where to go from there - I'm not sure how you apply it to derive any convergence.

4. ## Re: Convergence

Can you show that $h_n<f(n)$ for some decreasing function $f$? You don't have to solve the quadratic inequality $nh_n+n(n-1)/2\cdot h_n^2<n$ for $h_n$; just find some function $f$.
{"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": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 10, "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.9393336772918701, "perplexity_flag": "head"}