Take the 2-minute tour ×
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.

I know that

$$ \lim_{n\to\infty}{{2n}\choose{n}}^\frac{1}{n} = 4 $$ but I have no Idea how to show that; I think it has something to do with reducing ${n}!$ to $n^n$ in the limit, but don't know how to get there. How might I prove that the limit is four?

share|improve this question
add comment

5 Answers

up vote 15 down vote accepted

Hint: By induction, show that for $n\geq 2$ $$\frac{4^n}{n+1} < \binom{2n}{n} < 4^n.$$

share|improve this answer
1  
+1. Way easier than mine. –  user17762 Mar 4 '13 at 23:00
1  
Better lower bound than mine (+1) –  robjohn Mar 5 '13 at 1:32
add comment

Use Stirling formula $$n! \sim \sqrt{2 \pi n} \left(\dfrac{n}e \right)^n$$ This gives us that $$\dbinom{2n}n \sim \dfrac{4^n}{\sqrt{\pi n}}$$ Now conclude that $$\lim_{n \to \infty} \dbinom{2n}n^{1/n} = 4$$

share|improve this answer
    
The last step is wrong, you get $4 \pi^{-1/8} \cdot \lim_{n \rightarrow \infty} n^{-1/2 n} = 4 \pi^{-1/8}$ –  vonbrand Mar 5 '13 at 17:21
    
@vonbrand ${{2000}\choose{1000}}^{\frac{1}{1000}} \approx 3.983\ \gt\ 4\pi^{-1/8}$ –  Jakob Weisblat Mar 5 '13 at 22:12
    
@vonbrand the power of $\pi$ is $\pi^{-\frac{1}{2n}}$. –  TZakrevskiy Aug 22 '13 at 11:11
add comment

The term ${2n\choose n}$ occurs as biggest of $2n+1$ positive summands in expanding $(1+1)^{2n}$, which directly shows $\frac{4^n}{2n+1}\le {2n\choose n}\le 4^n$. From this the claim follows by using $\sqrt[n]n\to 1$.

share|improve this answer
    
Simple but effective observation (+1) –  robjohn Mar 5 '13 at 1:33
    
Yes, but it only shows that $0 \le \lim_{n \rightarrow \infty} \binom{2n}{n}^{1/n} \le 4$. –  vonbrand Mar 5 '13 at 17:31
    
@vonbrand No, it shows $\frac 4{\lim \sqrt[n]{2n+1}}\le \ldots \le 4$, hence equality as required. Note that the well-known $\sqrt[n] n\to 1$ also implies $\sqrt[n] {2n+1}\to 1$. Actually, I just wanted to avoid the big Stirling gun because this "one step" using the immediate defintion of binomial coeffivient works. –  Hagen von Eitzen Mar 5 '13 at 21:09
    
Something is very wrong. My own computation shows the limit is $4 \pi^{-1/8}$, as do other results here. –  vonbrand Mar 5 '13 at 22:05
    
@vonbrand Which limit is $4\pi^{-1/8}$ and which other results here show that? –  Hagen von Eitzen Mar 5 '13 at 22:20
add comment

Hint: $$ \begin{align} \binom{2n}{n} &=\frac{2n(2n-1)}{n^2}\frac{(2n-2)(2n-3)}{(n-1)^2}\frac{(2n-4)(2n-5)}{(n-2)^2}\cdots\frac{4\cdot3}{2^2}\frac{2\cdot1}{1^2}\\ &=2^n\frac{2n-1}{n}\frac{2n-3}{n-1}\frac{2n-5}{n-2}\cdots\frac{3}{2}\frac{1}{1}\\ &=4^n\frac{n-1/2}{n}\frac{n-3/2}{n-1}\frac{n-5/2}{n-2}\cdots\frac{3/2}{2}\frac{1/2}{1}\tag{1}\\ &\ge4^n\frac{n-1}{n}\frac{n-2}{n-1}\frac{n-3}{n-2}\cdots\frac{1}{2}\cdot1/2\\ &=4^n\frac1{2n}\tag{2} \end{align} $$ $(1)$ and $(2)$ show that $$ \frac1{2n}4^n\le\binom{2n}{n}\le4^n\tag{3} $$

share|improve this answer
add comment

You could use Stirling’s approximation:

$$\lim_{n\to\infty}\frac{n!}{\sqrt{2n\pi}(n/e)^n}=1\;.$$

Then

$$\binom{2n}n=\frac{(2n)!}{n!^2}\approx\frac{\sqrt{4n\pi}(2n/e)^{2n}}{2n\pi(n/e)^{2n}}=\frac{4^n}{\sqrt{n\pi}}\;,$$

so $$\binom{2n}n^{1/n}\approx\frac4{(\pi n)^{1/n}}\;.$$

I’ll let you fill in the details to show that $\approx$ here can be replaced by $\sim$, meaning that the ratio tends to $1$.

share|improve this answer
add comment

Your Answer

 
discard

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.