Show that the following sequences converge n!/n^n
\[\frac{ n! }{ n^n }\]
Would be great if you could use Sterling's formula here.
never heard of it. maybe squeeze therom.
What you wanna bound it above by?
ill upload a pic, of what the lecturer posted. i dont understand the upper bound. 1 sec
Wait, this isn't series convergence... just limit convergence?
not sure, what u mean
its a sequence convergence
Alright, then what you have looks good.
how did he get the upper bound, of 1/n
?? Ratio \(\dfrac{\dfrac{(n+1)!}{(n+1)^{n+1}}}{\dfrac{n!}{n^{n}}} = \dfrac{(n+1)!}{n!}\dfrac{n^{n}}{(n+1)^{n+1}} = (n+1)\dfrac{n^{n}}{(n+1)^n}\dfrac{1}{n+1} = \left(\dfrac{n}{n+1}\right)^{n}\) \(\lim\limits_{n\rightarrow\infty}\left(\dfrac{n}{n+1}\right)^{n} = \dfrac{1}{e} < 1\)
didnt really answer the question about the upper bound of 1/n, but u get points anway
ill ask it this way
how is (1/n)*(2/n)...n/n < 1/n
take for example n = 3. then 1*2*3/3 is not less than 1/3
For large enough n 2/n < 1 3/n < 1 ,,, n/n = 1 Thus: (2/n)(3/n)...(n/n) < 1 Thus (1/n)(2/n)(3/n)...(n/n) < 1/n (1/1)(1/2)(1/3) < 1/3
why is your n changing, u said (1/n)(2/n)(3/n)...(n/n) < 1/n. but then the next line you give n different values.
Whoops. Good call (1/n)(2/n)(3/n) < 3/n because (1/n)(2/n) < 1 But we can do better than that. (1/n)(2/n)(3/n) < 1/n because (3/n)(2/n) < 1
ok, so to clarify. (1/n)(2/n)(3/n) < 1/n because (3/n)(2/n) < 1 because (3/3)*(2/3)<1
well because because (3/3)*(2/3)*(1/3)<1
Join our real-time social learning platform and learn together with your friends!