Summation from k to m of r Choose k by s Choose n-k by nr-(r+s)k

Theorem

 * $\ds \sum_{k \mathop = 0}^m \dbinom r k \dbinom s {n - k} \paren {n r - \paren {r + s} k} = \paren {m + 1} \paren {n - m} \dbinom r {m + 1} \dbinom s {n - m}$

Proof
The proof proceeds by induction over $m$.

For all $m \in \Z_{\ge 0}$, let $P \left({n}\right)$ be the proposition:
 * $\ds \sum_{k \mathop = 0}^m \dbinom r k \dbinom s {n - k} \paren {n r - \paren {r + s} k} = \paren {m + 1} \paren {n - m} \dbinom r {m + 1} \dbinom s {n - m}$

Basis for the Induction
$\map P 0$ is the case:

Thus $\map P 0$ is seen to hold.

This is the basis for the induction.

Induction Hypothesis
Now it needs to be shown that, if $\map P j$ is true, where $j \ge 1$, then it logically follows that $\map P {j + 1}$ is true.

So this is the induction hypothesis:
 * $\ds \sum_{k \mathop = 0}^j \dbinom r k \dbinom s {n - k} \paren {n r - \paren {r + s} k} = \paren {j + 1} \paren {n - j} \dbinom r {j + 1} \dbinom s {n - j}$

from which it is to be shown that:
 * $\ds \sum_{k \mathop = 0}^{j + 1} \dbinom r k \dbinom s {n - k} \paren {n r - \paren {r + s} k} = \paren {j + 2} \paren {n - j - 1} \dbinom r {j + 2} \dbinom s {n - j - 1}$

Induction Step
This is the induction step:

So $\map P j \implies \map P {j + 1}$ and the result follows by the Principle of Mathematical Induction.

Therefore:
 * $\ds \sum_{k \mathop = 0}^m \dbinom r k \dbinom s {n - k} \paren {n r - \paren {r + s} k} = \paren {m + 1} \paren {n - m} \dbinom r {m + 1} \dbinom s {n - m}$