Mathematical theorem on convolved binomial coefficients
In combinatorics, Vandermonde's identity (or Vandermonde's convolution) is the following identity for binomial coefficients:
![{\displaystyle {m+n \choose r}=\sum _{k=0}^{r}{m \choose k}{n \choose r-k}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/fdad4f9c347f675b3d24ba5cd33a46f250a17f8f)
for any nonnegative integers r, m, n. The identity is named after Alexandre-Théophile Vandermonde (1772), although it was already known in 1303 by the Chinese mathematician Zhu Shijie.[1]
There is a q-analog to this theorem called the q-Vandermonde identity.
Vandermonde's identity can be generalized in numerous ways, including to the identity
![{\displaystyle {n_{1}+\dots +n_{p} \choose m}=\sum _{k_{1}+\cdots +k_{p}=m}{n_{1} \choose k_{1}}{n_{2} \choose k_{2}}\cdots {n_{p} \choose k_{p}}.}](https://wikimedia.org/api/rest_v1/media/math/render/svg/c6430edc1272e716e3f29a78ba10d6374da6a2d0)
- ^ See Askey, Richard (1975), Orthogonal polynomials and special functions, Regional Conference Series in Applied Mathematics, vol. 21, Philadelphia, PA: SIAM, pp. 59–60 for the history.