Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I have to show that $\lim \limits_{n\rightarrow\infty}\frac{n!}{(2n)!}=0$

I am not sure if correct but i did it like this : $(2n)!=(2n)\cdot(2n-1)\cdot(2n-2)\cdot ...\cdot(2n-(n-1))\cdot (n!)$ so I have $$\displaystyle \frac{1}{(2n)\cdot(2n-1)\cdot(2n-2)\cdot ...\cdot(2n-(n-1))}$$ and $$\lim \limits_{n\rightarrow \infty}\frac{1}{(2n)\cdot(2n-1)\cdot(2n-2)\cdot ...\cdot(2n-(n-1))}=0$$ is this correct ? If not why ?

share|cite|improve this question
It looks correct. – Eckhard Apr 6 '13 at 10:55
You did it alright – UrošSlovenija Apr 6 '13 at 10:55
thanks but maybe i need to show that it is bounded from bellow and above. – Devid Apr 6 '13 at 10:55
+1 for showing your progress and thoughts about the problem! Too many people just post their question and expect to get an answer to paste into their homework. – Zev Chonoles Apr 6 '13 at 10:58
up vote 3 down vote accepted

It's correct, but I imagine you're expected to show a bit more work to justify your assertion that $$\lim \limits_{n\rightarrow \infty}\frac{1}{(2n)\cdot(2n-1)\cdot(2n-2)\cdot ...\cdot(2n-(n-1))}=0$$ An easy way to do this is to bound this sequence of fractions with another, simpler one whose limit you know is 0.

share|cite|improve this answer
This was a exam problem. I was thinking about showing that it is bounded. But i did not cause i could not find a supremum. Hopefully i get some points. Thanks for the answer. – Devid Apr 6 '13 at 11:05



share|cite|improve this answer
this is comment, not an answer? – ArtemStorozhuk Apr 6 '13 at 11:00
I see now, using the Sandwich Theorem can show that the $lim$ is $0$. Thanks and +1 – Devid Apr 6 '13 at 11:06

Another hint based on using series may be that, if the series $$\sum_0^{\infty}u_n$$ is convergent so $u_n\to 0$.

share|cite|improve this answer


$$ 0 \leq \lim_{n\to \infty}\frac{n!}{(2n)!} \leq \lim_{n\to \infty} \frac{n!}{(n!)^2} = \lim_{k \to \infty, k = n!}\frac{k}{k^2} = \lim_{k \to \infty}\frac{1}{k} = 0.$$

share|cite|improve this answer
nice this is interesting – Devid Apr 6 '13 at 11:25

If so addressing trivial rigorously I suggest using the notation produtory to fatorial use the formula $n!=\prod_{k=1}^{n}$ . \begin{align} 0\leq \frac{n!}{(2n)!} = & \frac{\big(\prod_{k=1}^{n}k\big)}{\big(\prod_{k=1}^{2n}k\big)} \\ = & \frac{\big(\prod_{k=1}^{n}k\big)}{\big(\prod_{k=n+1}^{2n}k\big)\big(\prod_{k=1}^{n}k\big)} \\ = & \frac{1}{\big(\prod_{k=n+1}^{2n}k\big)}\frac{\big(\prod_{k=1}^{n}k\big)}{\big(\prod_{k=1}^{n}k\big)} \\ = & \frac{1}{\big(\prod_{k=n+1}^{k=2n}k\big)} \\ = & \frac{1}{2n\big(\prod_{k=n+1}^{2n-1}k\big)} \\ = & \frac{1}{2n}\frac{1}{\big(\prod_{k=n+1}^{2n-1}k\big)} \\ \leq & \frac{1}{2n} \end{align}

share|cite|improve this answer
Nice this is also a nice solution – Devid Apr 6 '13 at 11:37

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.