Math 2.0

statement theorem

Vandermonde's identity

Statement

Let mm, nn and rr be natural numbers. Then (m+nr)=∑k=0r(mk)(nr−k).\binom{m + n}{r} = \sum_{k=0}^{r} \binom{m}{k} \binom{n}{r - k}.

Remarks

Combinatorial proof: take a set of mm men and nn women. An rr-element committee has some number kk of men and r−kr - k women. With m=n=rm = n = r, and the symmetry of binomial coefficients, it gives (2nn)=∑k=0n(nk)2\binom{2n}{n} = \sum_{k=0}^{n} \binom{n}{k}^2.

Explanations

L1 human

To choose rr people from two groups together, choose kk from the first group and r−kr - k from the second, for each possible kk. Then add the counts for all values of kk.

What this node needs for W2
  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (0 of 1)

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

What this needs

To read this node, read these 2 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Binomial coefficient definition
  2. Vandermonde's identity statement

Sources

  1. Web https://en.wikipedia.org/wiki/Vandermonde's_identity, lead section