anonymous
  • anonymous
Evaluate the limit
Mathematics
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
schrodinger
  • schrodinger
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
\[\lim_{n \rightarrow \infty}\frac{ n! }{ n^n }\]
anonymous
  • anonymous
If I expand the factorial the first n term cancels but I'm really sure where to go from there.
anonymous
  • anonymous
|dw:1441847154717:dw|

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

anonymous
  • anonymous
Not sure how to keep going after that...
zzr0ck3r
  • zzr0ck3r
show that \(n!
anonymous
  • anonymous
Induction. Ohh boy.
Rizags
  • Rizags
I would begin by changing \[\frac{n!}{n^n}\] into \[n^{-n}n!\] then logarithms
anonymous
  • anonymous
If we are going to use logs and then L'Hopitals rule I am not allowed to do that. I have to do this without L'hopital's rule.
anonymous
  • anonymous
I mean, I could use induction to show that n! is less than n^n and then take the limit. Would that be sufficient?
Zarkon
  • Zarkon
\[\frac{n!}{n^n}=\frac{n(n-1)\cdots 32}{nn\cdots nn}\frac{1}{n}\le1\cdot \frac{1}{n}=\frac{1}{n}\]
anonymous
  • anonymous
Where did you get a 32 from?
Zarkon
  • Zarkon
...3*2*1
anonymous
  • anonymous
Ohh.
anonymous
  • anonymous
Nope still not clicking.
anonymous
  • anonymous
Wait I got it. it was just induction. Bah.
jim_thompson5910
  • jim_thompson5910
Proving n! < n^n Here's an informal argument. It probably won't work as a proof, but it's the way I see it n! = n*(n-1)*(n-2)*...*3*2*1 n^n = n*n*n...*n*n There are n copies of factors being multiplied in each term. So we can pair up the factors between n! and n^n n pairs with n (first factors) n-1 pairs with n (second factors) n-2 pairs with n (third factors) and so on until... 3 pairs with n (third to last factors) 2 pairs with n (second to last factors) 1 pairs with n (last factors) On the left side we have n,n-1,n-2,... those factors are getting smaller. On the right side, the factors stay as n which don't change. So one side (n!) gets smaller factors while the other side (n^n) has the factors stay the same. So the product of all of this must have n! < n^n. There is no way to have n! > n^n since the factors of n! would have to be larger than the corresponding factors of n^n Again this is just an informal way to think of it and not a formal proof.
Zarkon
  • Zarkon
\[\frac{n}{n}\frac{n-1}{n}\frac{n-2}{n}\cdots\frac{3}{n}\frac{2}{n}\frac{1}{n}\le 1\cdot1\cdot1\cdots1\cdot1\cdot\frac{1}{n}=\frac{1}{n}\] then use squeeze theorem
anonymous
  • anonymous
Aha! That's brilliant! I used induction but there seems to be 2 methods :) .

Looking for something else?

Not the answer you are looking for? Search for more explanations.