Maths WorkshopMaths problems with full solutions
Exercise 2087Combinatorics › Binomial coefficientsM1Added 3 Nov 2026

Gauss's binomial theorem

#Gauss binomial#hypergeometric#identity

Statement

State Gauss's 2F1(1){}_2F_1(1) evaluation:
2F1 ⁣(a,bc;1)=Γ(c)Γ(c−a−b)Γ(c−a)Γ(c−b),{}_2F_1\!\left(\begin{matrix}a,b\\c\end{matrix};1\right)=\frac{\Gamma(c)\Gamma(c-a-b)}{\Gamma(c-a)\Gamma(c-b)},
and deduce ∑k=0n(nk)2=(2nn)\sum_{k=0}^{n}\binom{n}{k}^2=\binom{2n}{n}.

Hint

Specialize to appropriate parameters.

Show solutionHide solution

Solution

Gauss. The evaluation above holds for Re⁡(c−a−b)>0\operatorname{Re}(c-a-b)>0.

Deduce the binomial identity. The sum ∑k(nk)2=∑k(nk)(nn−k)\sum_k\binom{n}{k}^2=\sum_k\binom{n}{k}\binom{n}{n-k} is exactly Vandermonde's identity, giving (2nn)\binom{2n}{n}.

Conclusion. Gauss's theorem generalizes Vandermonde's identity and reduces to it for specific parameters.