Maths WorkshopMaths problems with full solutions
Exercise 1605Combinatorics › Counting principlesL1Added 3 Nov 2026

A combinatorial identity

#combinatorial identity#double counting#binomial

Statement

Show that ∑k=0n(nk)2=(2nn)\sum_{k=0}^{n}\binom{n}{k}^2=\binom{2n}{n}.

Hint

Use Vandermonde's identity with m=nm=n and k=nk=n.

Show solutionHide solution

Solution

Vandermonde. (m+nk)=∑j(mj)(nk−j)\binom{m+n}{k}=\sum_j\binom{m}{j}\binom{n}{k-j}.

Apply. With m=nm=n and k=nk=n: (2nn)=∑j(nj)(nn−j)=∑j(nj)2\binom{2n}{n}=\sum_j\binom{n}{j}\binom{n}{n-j}=\sum_j\binom{n}{j}^2.

Conclusion. The identity holds.

Combinatorial interpretation. Choose nn from 2n2n by taking jj from the first half and n−jn-j from the second.