Combinatorics

We know that ΣnCr*r2= n*2n-1 + n*(n-1)*2n-2
(see "http://www.targetiit.com/discuss/topic/21790/solve-this-binomial-question/" for the proof)

Further we can find
ΣnCr*r3 = n*2n-1 + 3*n(n-1)*2n-2 + n(n-1)(n-2)*2n-3

However on trying to find ΣnCr*r4,ΣnCr*r5 and higher powers it gets quite complicated and is tough to generalize.

Q: What is ΣnCr*rk where 0<k<n.

Be the first to Answer

Close [X]