Sunday, October 11, 2015

Understanding simplification of summation



I am reading the following proof and I am having trouble understanding this line of reasoning.

ni=1ikni=1nk=nnk



However, I do not understand how the second summation simplifies to nnk. Where is the i in the second summation to iterate? And without it, how can we even sum anything?


Answer



ni=1nk=nk++nkn times=nk(1++1n times)=nkn






Identities to remember: ni=11=n(add 1 n times)ni=1kai=kni=1ai(factoring out a constant) Putting those together you get ni=1k=kni=11=kn In this case nk is just a constant (with respect to i).


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...