Does anyone know how to show the following combinatorial equality, $\sum_{i=0}^{n}\left(n-i\right)^{2}\binom{2n}{i}=n\cdot4^{n-1}$?
By the way, this is not a homework problem, otherwise one would be able to search the answer.
Thanks.
|
-1
|
Does anyone know how to show the following combinatorial equality, $\sum_{i=0}^{n}\left(n-i\right)^{2}\binom{2n}{i}=n\cdot4^{n-1}$? By the way, this is not a homework problem, otherwise one would be able to search the answer. Thanks. |
|||||
|
|
0
|
I suggest you take a look on hypergeometric series. |
||
|
|
|
2
|
It's half the sum of the same thing from $0$ to $2n$, which in turn is easily related to the variance of the number of heads in a sequence of $2n$ tosses of a fair coin. |
|||||
|
|
0
|
Try the Wilf-Zeilberger method and its friends. This automatically proves many such (hypergeometric) identities. See the book A = B |
||
|
|