Tuesday, December 12, 2017

summation - Need help finding a sum



I found this problem that I'm not sure how to solve. I would appreciate if anyone could point me to the right direction.



I need to find the following sum:



i+j+k=7(1)i(1)j7!i!j!k! where i,j,k are elements of N0



There must be a much better way to solve this other than writing down all possible combinations and sum them (please correct me if I'm wrong).




The thing I believed could be useful was the multinomial theorem (I apologize if this is not the correct term in English), which states that:



(ki=1xi)n=ki=1ni=nn!ki=1ni!ki=1xnii



But I'm missing (1)k.



I'm a bit new to this subject, but couldn't find any example like this in my books. Thank you in advance!



EDIT: My apologies to anyone who read the original question, I've misplaced i and j, didn't see it while revising what I wrote. It's fixed now.



Answer



There is no (1)k because x3 is going to be 1: 1=((1)+(1)+1)7=i+j+k=7(1)i(1)j(1)k7!i!j!k!


No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...