View Single Post
  #1  
Old August 25th, 2008, 04:22 AM
Number Cruncher 20 Number Cruncher 20 is offline
Newbie
 
Join Date: May 2008
Posts: 20
Country:
Thanks: 5
Thanked 0 Times in 0 Posts
Number Cruncher 20 is on a distinguished road
Default Binomial Theorem and Sum Conversion

Hi,

I have been asked to derive a simple closed form expression for the
following sum:

n
∑ (-1)^(m+i) *(nCi)*(iCm) = S n, m
i = m

[with m = 0,1,2,....,n ; n= 0,1,2,....] and C is the combinations symbol.


I know that we are meant to be using the binomial theorem but I dont quite know where to go from there. Any help would be much appreciated.
Reply With Quote