I have a sum of factorials that I managed to put in the following form $$S = \sum_{k = 0}^{n} (-1)^k {{4n-1-2k}\choose{2n-2k}}{{2n-1}\choose{k}}$$ where $n\in\mathbb{N}$. Mathematica can sum this object and it gives $S = 2^{-1+2n}$. Despite searching countless identities I haven't found a way to prove this result. I have also tried induction but it doesn't seem to be the right approach.
2026-03-30 06:50:09.1774853409
On
Double Binomial coefficient sum identity $S = \sum_{k = 0}^{n} (-1)^k {{4n-1-2k}\choose{2n-2k}}{{2n-1}\choose{k}}$
354 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
2
There are 2 best solutions below
0
On
Yet another instance for these ideas... but this time the "pencil and paper" way is easier.
$S$ is the coefficient of $x^{2n}$ in (the power series expansion of) $$\left(\sum_{k=0}^{2n-1}(-1)^k\binom{2n-1}{k}x^{2k}\right)\left(\sum_{k=0}^{\infty}\binom{2n-1+k}{k}x^k\right)=(1-x^2)^{2n-1}(1-x)^{-2n}\\=\frac{(1+x)^{2n-1}}{1-x}=\frac{\big(2-(1-x)\big)^{2n-1}}{1-x}=\frac{2^{2n-1}}{1-x}-P(x),$$ where $P(x)$ is some polynomial of degree at most $2n-2$. The result follows.
We use the coefficient of operator $[z^k]$ to denote the coefficient of $z^k$ of a series. This way we can write for instance \begin{align*} [z^k](1+z)^n=\binom{n}{k}\tag{1} \end{align*}
Comment:
In (2) we apply the coefficient of operator according to (1). We also set the upper limit of the sum to $2n-1$ which does not change anything since $\binom{4n-1-2k}{2n-2k}=0$ if $k>n$.
In (3) we apply the rule $[z^{p-q}]A(z)=[z^p]z^qA(z)$.
In (4) we apply the binomial theorem.
In (5) we do some simplifications.
In (6) we observe the coefficient $[z^{2n}](1+2z)^{2n-1}$ is zero.
In (7) we select the coefficient of $z^{2n-1}$.