Monday, 19 January 2015

algebra precalculus - Show that for any real sgeq0, esqrtn!(n!)s<frac1n2 holds for sufficiently large n



Let s0 be a real number. Show that there exists a natural number n0N such that nN,nn0, we have
en!(n!)s<1n2



By taking logarithms, we need to show that
n!+slogn!+2logn<0

for sufficiently large n.
It would be sufficient to show that the limit of the sequence is a negative number; In order to do that, I thought of using the Stirling approximation, n!2πn(ne)n: then it would suffice to show
lim
however this looks kind of scary.



Intuitively, \sqrt{n!} is a polynomial in n! and so clearly grows much faster than any multiple of \log{n!}. It also clearly exceeds 2\log{n}, but I don't know how to make this rigorous.



Any ideas?


Answer



It is easy to check that for fixed s\geq 0,

\lim_{x\to\infty}e^{-\sqrt{x}}x^{2s}=0
Therefore, if x is sufficiently large,
e^{-\sqrt{x}}x^{2s}\leq 1\Longrightarrow e^{-\sqrt{x}}x^s\leq\frac{1}{x^s}
In particular, if n is sufficiently large
e^{-\sqrt{n!}}(n!)^s\leq\frac{1}{(n!)^s}
and it is not hard to check that for sufficiently large n we also have
\frac{1}{(n!)^s}\leq\frac{1}{n^2}


No comments:

Post a Comment

real analysis - How to find lim_{hrightarrow 0}frac{sin(ha)}{h}

How to find \lim_{h\rightarrow 0}\frac{\sin(ha)}{h} without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...