(3 intermediate revisions by the same user not shown)
Line 32: Line 32:
  
 
Step 2. To develop an estimate for <math> n^{\frac{1}{n}} </math>, Consider the following:  
 
Step 2. To develop an estimate for <math> n^{\frac{1}{n}} </math>, Consider the following:  
 +
Again, we use the Bernoulli inequality
  
<math> \left(1+\frac{1}{n}\right)^{n}
+
<math> \left( 1+\frac{1}{\sqrt{n}} \right)^{n} > 1 + n\frac{1}{\sqrt{n}} > \sqrt{n} </math>
1 + n\frac{1}{n}+\frac{n(n-1)}{2}\frac{1}{n^2}+\ldots+\frac{1}{n^{n}}</math>.
+
  
Now we notice that each term in the decomposition of the binomial is less than or equal to 1. Then,
+
Which, in turn implies
  
<math> \le  1+n < n </math>.
+
<math> 1+\frac{1}{\sqrt{n}} > n^{1/2n} </math>
  
But then, again,  
+
By squaring both sides,
  
<math> n^{\frac{1}{n}} < 1 + \frac{1}{n} </math>
+
<math> 1+2\frac{1}{\sqrt{n}}+\frac{1}{n} > n^{1/n} </math>
  
And then you can pick it up from here.
+
Step 3. Use
 +
 
 +
<math> 1 < (n!)^{\frac{1}{n^2}}  < n^{1/n} < 1+2\frac{1}{\sqrt{n}}+\frac{1}{n}  </math>
 +
 
 +
To conclude that all these goes to 1.
  
 
----
 
----

Latest revision as of 11:36, 11 March 2010

To ask a new question, add a line and type in your question. You can use LaTeX to type math. Here is a link to a short LaTeX tutorial.

To answer a question, open the page for editing and start typing below the question...

go back to the Discussion Page


Prof. Alekseenko: Problem #13 is a little bit tricky, so let me give some hints about the solution. The problem specifically directs you to use the Squeeze theorem. The difficult part is to come up with a correct estimate for the sequence.

Part (a) is not very hard. One can use the Bernoulli inequality. I will just indicate the basic steps and you will have to fill in the detail.

Step 1. Show that if $ a^n > b^n $ for some natural number $ n \, $ then $ a > b \, $. You can try to show it by a contradiction.

Step 2. Use a Bernoulli inequality to obtain the following: $ \left( 1+\frac{1}{n} \right)^{n^2} > 1 + n > n $

Conclude that $ 1+\frac{1}{n} > n^{\frac{1}{n^2}} $

Step 3. Use Step 1 again to conclude that $ 1 < n^{\frac{1}{n^2}} $

Step 4. Apply the squeeze theorem.

Part (b) is a bit trickier, however is not very hard. You will have to use some of the results in part (a), not not all of them.

Step 1. Notice that

$ 1 < (n!)^{\frac{1}{n^2}} = (1\cdot 2 \cdot \ldots \cdot n)^{\frac{1}{n^2}} $

$ < (n\cdot n \cdot \ldots \cdot n)^{\frac{1}{n^2}}= n^{\frac{1}{n}} $

Step 2. To develop an estimate for $ n^{\frac{1}{n}} $, Consider the following: Again, we use the Bernoulli inequality

$ \left( 1+\frac{1}{\sqrt{n}} \right)^{n} > 1 + n\frac{1}{\sqrt{n}} > \sqrt{n} $

Which, in turn implies

$ 1+\frac{1}{\sqrt{n}} > n^{1/2n} $

By squaring both sides,

$ 1+2\frac{1}{\sqrt{n}}+\frac{1}{n} > n^{1/n} $

Step 3. Use

$ 1 < (n!)^{\frac{1}{n^2}} < n^{1/n} < 1+2\frac{1}{\sqrt{n}}+\frac{1}{n} $

To conclude that all these goes to 1.


Alumni Liaison

Questions/answers with a recent ECE grad

Ryne Rayburn