Proving Binomial Identities: Sigma of k = 0 to m

bodensee9
Messages
166
Reaction score
0
hello,

i am supposed to show that

Sigma of k = 0 to m, (n, k) (n - k, m - k) = 2^m (n, m)

So I have after expanding:

(n, k) = n!/(n-k)!k! and (n-k, m-k) = (n-k)!/(m-k)!(n-m)!
so together the (n-k)! cancels out and I have
n!/k!(m-k)!(n-m)!
and that is
n!/m!(n-m)! which is
(n, m)

so then I can take (n, m) out of the sigma and then I would have
(n, m)*Sigma from k = 0 to m 1, but then how do I get the 2^m?

Thanks.
 
Physics news on Phys.org
You seem to think that 1/(k!*(m-k)!) is 1/m!. It's not. Try some numerical examples. On the other hand it's easy to find the sum of that quantity over k. You probably proved sum over k of (m,k)=2^m, didn't you?
 
Oh right. Thanks!

Yes, it's equal to (1 + 1) ^ m , so that is 2^m.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top