I am working through Probability Theory, the logic of Science by E.T. Jaynes and came across the following equation (6.16):
$$S \equiv \sum_{R=0}^N {R \choose r} {N - R \choose n - r} = {N + 1 \choose n + 1}$$
I have been trying to find a proof for this and came across the Chu–Vandermonde identity on wikipedia (eq. 9), which can take the form:
$$ \sum_{m=0}^n {m \choose j} {n - m \choose k - j} = {n + 1 \choose k + 1} $$
It looks like this is the identity that I need, but I have not been able to find a proof of this particular form and was hoping someone may be able to point me to it, or help me walk through it. Thanks!
$\binom{n+1}{k+1}$ counts the number of $(k+1)$-element subsets of the set $S=\{1,2,\ldots,n+1\}$. Let us count the number of these subsets whose $(j+1)$-th smallest element is $m+1$. Such a set contains, apart from $m+1$, $j$ elements from the set $\{1,\ldots,m\}$ and $k-j$ elements from $\{m+2,\ldots,n+1\}$. There are $\binom mj\binom{n-m}{k-j}$ such subsets. Adding up over all admissible values of $m$ gives the result.