So I can not figure out the combinatorial proof for Vandermonde's Identity for the example $\sum_{i=0}^k \binom {k} {i}^2 = \binom {2k} {k}$ Any help would be appreciated.
Figured it out, thanks :)
Asked
Active
Viewed 1,130 times
0
-
There’s one in the Wikipedia article. – Brian M. Scott Apr 08 '15 at 21:19
-
I'm sorry the post I selected is not the right one, I did not see the "inductive proof", maybe this one provides a combinatorial proof – Elaqqad Apr 08 '15 at 21:26
-
@Haris: The excellent answer to this question may also be useful. – Brian M. Scott Apr 08 '15 at 21:28