Sunday, 22 October 2017

combinatorics - Prove sumn2k=0nkchoose2=n+1choose3




Prove
n2k=0(nk2)=(n+13)




Is there a relation I can use that easily yields above equation?


Answer



n2k=0k2+k(12n)+n212

now, nk=1k=n(n+1)2 and nk=1k2=n(n+1)(2n+1)6



Hope it helps?


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...