# Finding lim${_{n \rightarrow \infty}}\left( \frac{n^3}{2^n} \right)$

For a class of mine we were given a midterm review; however, I just cannot figure out how to finish this one:

Find the limit $$\lim_{n \rightarrow \infty}\left( \dfrac{n^3}{2^n} \right)$$

My attempt so far:

Let $$s_n=\dfrac{n^3}{2^n}$$. Note that $$2^n=(1+1)^n$$. Thus by the Binomial Theorem we have that, $$(1+1)^n=\sum_{k=0}^{n} {n \choose k}(1)^{n-k}(1)^n$$ Evaluating some of the first couple I get the following terms: $$1+n+\dfrac{n(n-1)}{2}+\dfrac{n(n-1)(n-2)}{6}+\dfrac{n(n-1)(n-2)(n-3)}{24}+...$$

I have noticed that for $$n<4$$, $$n^3 \geq 2^n$$. However, it seems that when $$n\geq 4, n^3 < 2^n$$. Thus, would it be possible to make an argument that for $$n \geq 4, s_{4}>s_{5}>s_{6}>...$$? Therefore, by evaluating for $$n=4$$ and using some algebra you get the following:

$$s_{4}=\dfrac{24n^3}{24+24n+4n(n-1)(n-2)+n(n-1)(n-2)(n-3)} \leq \dfrac{24n^3}{n^4} = \dfrac{24}{n}$$

and we know that lim$$_{n \rightarrow \infty} \left( \dfrac{1}{n} \right)=0$$ and lim$$_{n \rightarrow \infty} \left( -\dfrac{1}{n} \right)=0$$

Therefore, since $$\dfrac{1}{n} \geq s_{4} > s_{5} >s_{6} > ...s_{n}\geq-\dfrac{1}{n}$$, by the Squeeze Theorem $$s_{n}$$ converges to zero as well?

Using your first idea, what about using the fact that $$(1+1)^n = \sum_{k=1}^n \binom{n}{k} \geq \binom{n}{4} = \frac{n(n-1)(n-2)(n-3)}{24} \geq \frac{(n-3)^4}{24}$$and concluding by the squeeze theorem? (as $\frac{24n^3}{(n-3)^4} \xrightarrow[n\to\infty]{} 0$).
Thats a long answer.Quick trick:$0 < \dfrac{n^3}{2^n} < \dfrac{1}{n}$.
• This inequality is not even valid for all $n\ge 1$. While it is true for "sufficiently large $n$," taking this as a given seems tantamount to taking the limit of interest as given. – Mark Viola May 5 '16 at 18:57
{"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": 1, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 15, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://math.stackexchange.com/questions/1773119/finding-lim-n-rightarrow-infty-left-fracn32n-right", "fetch_time": 1561419705000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2019-26/segments/1560627999779.19/warc/CC-MAIN-20190624231501-20190625013501-00302.warc.gz", "warc_record_offset": 501399947, "warc_record_length": 36809, "token_count": 734, "char_count": 1809, "score": 4.375, "int_score": 4, "crawl": "CC-MAIN-2019-26", "snapshot_type": "latest", "language": "en", "language_score": 0.7723946571350098, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00023-of-00064.parquet"}