Return to Answer

First, we note that Stirling's series yields $4^{-k} \binom{2k}{k} = \frac{1}{\sqrt{\pi k}}e^{-1/8k + O(k^{-3})}$.

Let $c = k/n$. Then

1. $\log n!$ expands as $n \log n - n + O(\log n)$.
2. $\log (2k)!$ expands as $2cn \log 2cn - 2cn + O(\log n)$.
3. $\log(n-2k)!$ expands as $n(1-2c)(\log n - \log(1-2c)) - n(1-2c) + O(\log n)$.
4. $\log \binom{n}{2k}$ expands as $-2cn\log 2c + n(1-2c) \log (1-2c) + O(\log n)$. This is $n$ times the following function of $c$:
5. $\frac{2n \log 2}{\log n} \log\left(\frac{1}{\sqrt{\pi k}}e^{-1/8k + O(k^{-3})}\negthinspace\right)$ expands as $\frac{n \log 2}{\log n}(-\log n -\log c -\log \pi) - O(\frac{1}{c\log n})$

We need to consider the asymptotics of the sum of the 4th and 5th terms. The 5th term is dominated by $-n \log 2$, unless $c\sim 1/n$ (i.e., $k\sim 1$), while the graph suggests that the fourth term is dominated by $n$ times roughly $0.15$. We can make this more precise by taking a derivative with respect to $c$: solving $2c(1-2c)=e^{-2}$ yields $c$ about $0.0806891^+$, with optimal value about $0.14676^+$. Each term in the sum then has logarithm at most about $-0.5463^+ n$ for nontrivial $k$, and $0$ for $k\sim 0$. Thus the sum is eventually bounded above by $1+\frac{n}{2} e^{-0.54 n}$ which converges to $1$ as $n \to +\infty$.

First, we note that Stirling's series yields $4^{-k} \binom{2k}{k} = \frac{1}{\sqrt{\pi k}}e^{-1/8k + O(k^{-3})}$.

Let $c = k/n$. Then

1. $\log n!$ expands as $n \log n - n + O(\log n)$.
2. $\log (2k)!$ expands as $2cn \log 2cn - 2cn + O(\log n)$.
3. $\log(n-2k)!$ expands as $n(1-2c)(\log n + \log(1-2c)) - n(1-2c) + O(\log n)$.
4. $\log \binom{n}{2k}$ expands as $-2cn\log 2c - n(1-2c) \log (1-2c) + O(\log n)$. This is $n$ times the following function of $2c$:
5. $\frac{2n \log 2}{\log n} \log\left(\frac{1}{\sqrt{\pi k}}e^{-1/8k + O(k^{-3})}\negthinspace\right)$ expands as $\frac{n \log 2}{\log n}(-\log n -\log c -\log \pi) - O(\frac{1}{c\log n})$

We need to consider the asymptotics of the sum of the 4th and 5th terms. The 5th term is dominated by $-n \log 2$, unless $c\sim 1/n$ (i.e., $k\sim 1$ - a short calculation shows we don't need to worry about this case). From calculus (or brief examination of Pascal's triangle) the fourth term achieves its maximum value of $n \log 2$ at $c=1/4$. The sum is then dominated by the term $\frac{n \log 2}{\log n}(-\log c -\log \pi)$. Since $\pi c = \pi/4 < 1$, we have $(-\log c -\log \pi)>0$, so the sum $\frac{n \log 2}{\log n}(-\log c -\log \pi) + O(\log n)$ increases without bound.

In conclusion, the sum diverges, because the summand for $k = \lfloor \frac{n}{4} \rfloor$ increases without bound as $n$ increases.

First, we note that Stirling's series yields $4^{-k} \binom{2k}{k} = \frac{1}{\sqrt{\pi k}}e^{-1/8k + O(k^{-3})}$.

Let $c = k/n$. Then

1. $\log n!$ expands as $n \log n - n + O(\log n)$.
2. $\log (2k)!$ expands as $2cn \log 2cn - 2cn + O(\log n)$.
3. $\log(n-2k)!$ expands as $n(1-2c)(\log n - \log(1-2c)) - n(1-2c) + O(\log n)$.
4. $\log \binom{n}{2k}$ expands as $2cn\log 2c - n(1-2c) \log (1-2c) + O(\log n)$. This is $n$ times the following function of $2c$:
5. $\frac{2n \log 2}{\log n} \log\left(\frac{1}{\sqrt{\pi k}}e^{-1/8k + O(k^{-3})}\negthinspace\right)$ expands as $\frac{n \log 2}{\log n}(-\log n -\log c -\log \pi) - O(\frac{1}{c\log n})$

We need to consider the asymptotics of the sum of the 4th and 5th terms. The 5th term is dominated by $-n \log 2$, unless $c\sim 1/n$ (i.e., $k\sim 1$), while the graph suggests that the fourth term is dominated by $n$ times roughly $0.15$. We can make this more precise by taking a derivative with respect to $c$: solving $2c(1-2c)=e^{-2}$ yields $c$ about $0.41931^+$, with optimal value about $0.14676^+$. Each term in the sum then has logarithm at most about $-0.5463^+ n$ for nontrivial $k$, and $0$ for $k\sim 0$. Thus the sum is eventually bounded above by $1+\frac{n}{2} e^{-0.54 n}$ which converges to $1$ as $n \to +\infty$.

First, we note that Stirling's series yields $4^{-k} \binom{2k}{k} = \frac{1}{\sqrt{\pi k}}e^{-1/8k + O(k^{-3})}$.

Let $c = k/n$. Then

1. $\log n!$ expands as $n \log n - n + O(\log n)$.
2. $\log (2k)!$ expands as $2cn \log 2cn - 2cn + O(\log n)$.
3. $\log(n-2k)!$ expands as $n(1-2c)(\log n - \log(1-2c)) - n(1-2c) + O(\log n)$.
4. $\log \binom{n}{2k}$ expands as $-2cn\log 2c + n(1-2c) \log (1-2c) + O(\log n)$. This is $n$ times the following function of $c$:
5. $\frac{2n \log 2}{\log n} \log\left(\frac{1}{\sqrt{\pi k}}e^{-1/8k + O(k^{-3})}\negthinspace\right)$ expands as $\frac{n \log 2}{\log n}(-\log n -\log c -\log \pi) - O(\frac{1}{c\log n})$

We need to consider the asymptotics of the sum of the 4th and 5th terms. The 5th term is dominated by $-n \log 2$, unless $c\sim 1/n$ (i.e., $k\sim 1$), while the graph suggests that the fourth term is dominated by $n$ times roughly $0.15$. We can make this more precise by taking a derivative with respect to $c$: solving $2c(1-2c)=e^{-2}$ yields $c$ about $0.0806891^+$, with optimal value about $0.14676^+$. Each term in the sum then has logarithm at most about $-0.5463^+ n$ for nontrivial $k$, and $0$ for $k\sim 0$. Thus the sum is eventually bounded above by $1+\frac{n}{2} e^{-0.54 n}$ which converges to $1$ as $n \to +\infty$.

First, we note that Stirling's series yields $4^{-k} \binom{2k}{k} = \frac{1}{\sqrt{\pi k}}e^{-1/8k + O(k^{-3})}$.

Let $c = k/n$. Then

1. $\log n!$ expands as $n \log n - n + O(\log n)$.
2. $\log (2k)!$ expands as $2cn \log 2cn - 2cn + O(\log n)$.
3. $\log(n-2k)!$ expands as $n(1-2c)(\log n - \log(1-2c)) - n(1-2c) + O(\log n)$.
4. $\log \binom{n}{2k}$ expands as $2cn\log 2c - n \log (1-2c) + 2cn\log(1-2c) + O(\log n)$.
5. $\frac{2n \log 2}{\log n} \log\left(\frac{1}{\sqrt{\pi k}}e^{-1/8k + O(k^{-3})}\negthinspace\right)$ expands as $\frac{n \log 2}{\log n}(-\log n -\log c -\log \pi) - O(\frac{1}{c\log n})$

If $c$ shrinks as $n$ grows, then the dominant term in the last two expansions is $-n \log 2$. If $c$ is asymptotic to a constant in terms of $n$, then we can optimize by taking a derivative with respect to $c$. Solving $2c(1-2c)=e^{-2}$ yields $c$ about $0.41931^+$, and the dominant term in the sum then has logarithm about $-0.5463^+ n$. Thus the sum is eventually bounded above by $\frac{n}{2} e^{-0.54 n}$ which shrinks toward zero as $n \to +\infty$.

First, we note that Stirling's series yields $4^{-k} \binom{2k}{k} = \frac{1}{\sqrt{\pi k}}e^{-1/8k + O(k^{-3})}$.

Let $c = k/n$. Then

1. $\log n!$ expands as $n \log n - n + O(\log n)$.
2. $\log (2k)!$ expands as $2cn \log 2cn - 2cn + O(\log n)$.
3. $\log(n-2k)!$ expands as $n(1-2c)(\log n - \log(1-2c)) - n(1-2c) + O(\log n)$.
4. $\log \binom{n}{2k}$ expands as $2cn\log 2c - n(1-2c) \log (1-2c) + O(\log n)$. This is $n$ times the following function of $2c$:
5. $\frac{2n \log 2}{\log n} \log\left(\frac{1}{\sqrt{\pi k}}e^{-1/8k + O(k^{-3})}\negthinspace\right)$ expands as $\frac{n \log 2}{\log n}(-\log n -\log c -\log \pi) - O(\frac{1}{c\log n})$

We need to consider the asymptotics of the sum of the 4th and 5th terms. The 5th term is dominated by $-n \log 2$, unless $c\sim 1/n$ (i.e., $k\sim 1$), while the graph suggests that the fourth term is dominated by $n$ times roughly $0.15$. We can make this more precise by taking a derivative with respect to $c$: solving $2c(1-2c)=e^{-2}$ yields $c$ about $0.41931^+$, with optimal value about $0.14676^+$. Each term in the sum then has logarithm at most about $-0.5463^+ n$ for nontrivial $k$, and $0$ for $k\sim 0$. Thus the sum is eventually bounded above by $1+\frac{n}{2} e^{-0.54 n}$ which converges to $1$ as $n \to +\infty$.