Proving n^n > 2^n *n using the Binomial theorem

dot.hack
Messages
9
Reaction score
0

Homework Statement


Prove that n^n > 2^n * n! when n > 6 using the Binomial theorem.
I just proved the Binomial theorem using induction which was not that difficult but in applying what I learned through it's proof I am having difficulty.

Homework Equations


Binomial theorem = (x+y)^n = \sum_{k=0}^n\binom{n}{k}x^{n-k}y^k


The Attempt at a Solution


I attempted setting n= (x+y) to convert the left side of the equation into the form of the binomial theorem, as well as turning the right hand side into the form of the binomial theorem by setting x+y = 2 both to no avail. Actually the "closest" (I put this in quotes because as I couldn't solve it, I have no idea how close I really was) I got was by using induction and turning the equation into {\frac{(n+1)^n }{2}}= 2^n + n!
Thanks for the help guys.
 
Physics news on Phys.org
Actually, the last equation I wrote have n!/2
thanks
 
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...
Back
Top