I meet an expression as following: $$L_{N}=\frac{C_{2N}^{N}}{2^{2N}}=\frac{(2N)!}{N!N!2^{2N}}$$
My conjecture is that: $$\lim_{N \to \infty}L_{N}=0$$
It seems to be an easy question, but how to show it simply?
I meet an expression as following: $$L_{N}=\frac{C_{2N}^{N}}{2^{2N}}=\frac{(2N)!}{N!N!2^{2N}}$$
My conjecture is that: $$\lim_{N \to \infty}L_{N}=0$$
It seems to be an easy question, but how to show it simply?
This question appears to be off-topic. The users who voted to close gave this specific reason:
Erdos gives ${{2n}\choose{n}}4^{-n}<1/\sqrt{2n+1}$ in his book with Suranyi. For an inductive proof one needs to show $$ \frac{2n(2n-1)}{4n^2}\cdot\frac{1}{\sqrt{2n-1}}<\frac{1}{\sqrt{2n+1}} $$ which simplifies to $\sqrt{2n-1}\sqrt{2n+1}<2n$.
You're right. It is easy with Stirling's approximation $$N! \sim \sqrt{2\pi N}\left(\frac{N}e\right)^N$$ so that $$L_N=\frac{(2N)!}{N!N!2^{2N}} \sim \frac{\sqrt{2\pi(2N)}(2N)^{2N}}{e^{2N}2^{2N}}\frac{e^{2N}}{(2\pi N)N^{2N}}=\frac1{\sqrt{\pi N}}\rightarrow 0$$ as $N\rightarrow\infty$.