Math 2.0

Combinatorics Proposition

Generalized Vandermonde's identity

Statement

One can generalize Vandermonde's identity as follows:

∑k1+⋯+kp=m(n1k1)(n2k2)⋯(npkp)=(n1+⋯+npm).\sum_{k_1+\cdots +k_p = m} {n_1\choose k_1} {n_2\choose k_2} \cdots {n_p\choose k_p} = { n_1+\dots +n_p \choose m }.

This identity can be obtained through the algebraic derivation above when more than two polynomials are used, or through a simple double counting argument.

On the one hand, one chooses k1\textstyle k_1 elements out of a first set of n1\textstyle n_1 elements; then k2\textstyle k_2 out of another set, and so on, through p\textstyle p such sets, until a total of m\textstyle m elements have been chosen from the p\textstyle p sets. One therefore chooses m\textstyle m elements out of n1+⋯+np\textstyle n_1+\dots +n_p in the left-hand side, which is also exactly what is done in the right-hand side.

Further reading

  1. Wikipedia, page 916157, revision 1370490483, Vandermonde's identity, section Generalizations > Generalized Vandermonde's identity. adopted
About this page
Tag6RRNPDPW91
URIm2://6RRNPDPW91
Kindstatement, proposition
WritingW0 stub
MSC05A19
StatusThis copy of the site has no build data. Run m2 status 6RRNPDPW91.
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • edge uses out: each definition that the statement needs (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.