- #1
Dragonfall
- 1,030
- 4
I have a bunch of equations that I must prove 'using combinatorics', which means double counting or some sort of bijective mapping. I haven't done this before, and I'd like to know, as an example, how the following can be proved 'combinatorially':
[tex]\left(\begin{array}{cc}{n+1}\\{m+1}\end{array}\right)=\sum_{i=0}^{n-m}\left(\begin{array}{cc}{m+i}\\m\end{array}\right)[/tex]
[tex]\left(\begin{array}{cc}{n+1}\\{m+1}\end{array}\right)=\sum_{i=0}^{n-m}\left(\begin{array}{cc}{m+i}\\m\end{array}\right)[/tex]