Show that ##\lim_{n->\infty} \frac{n^2}{2^n} = 0 ##

  • Thread starter Thread starter kwangiyu
  • Start date Start date
  • Tags Tags
    Real analysis
kwangiyu
Messages
2
Reaction score
0

Homework Statement


show that
\lim_{n->\infty} \frac{n^2}{2^n} = 0

Homework Equations


squeeze theorem

The Attempt at a Solution




I tried to use squeez theorem. I don't know how to do it because don't know how to reduce 2^n

However, I can solve this question like this.

Given \epsilon>0, find M \in N such that M > max (4, \frac{1}{\epsilon}) \mid \frac{n^2}{2^n} \mid = \frac{n^2}{2^n} < \frac{n}{n^2} = \frac{1}{n} < \frac{1}{M} <\epsilon

2^n > n^2 and if x>4My question is how can I solve this problem with squeez theorem ?

 
Last edited by a moderator:
Physics news on Phys.org
What about ##2^n > n^3## ?
And I think you also need it in your prove. How became ##n^2 < n## in the above?
 
fresh_42 said:
What about ##2^n > n^3## ?
And I think you also need it in your prove. How became ##n^2 < n## in the above?
oh.. I made mistake. but 2^n < n^3 isn't it ?
 
Yes, although you then need a higher lower bound for ##M##. ##4## won't do anymore, but this isn't a problem.
And with that, your proof works and you can also use the same estimations for the squeeze theorem.
 
kwangiyu said:

Homework Statement


show that
\lim_{n-&gt;\infty} \frac{n^2}{2^n} = 0

<snip>
My question is how can I solve this problem with squeez theorem ?
Is there some reason you need to use the squeeze theorem?

The expression you're taking the limit of can be written as ##\left(\frac{n^{2/n}} 2\right)^n##
The problem then boils down to showing that ##\frac{n^{2/n}} 2 < 1##, which can be done using induction.
 
Looks like the OP did not state/show whether he could proceed to solution...no follow up on his part.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Back
Top