Proof by induction

Albi

Junior Member
Joined
May 9, 2020
Messages
145
Guys, I'm trying to prove that k=1nk(nk)2=n(2n1n1)\sum ^{n}_{k=1}k\binom{n}{k}^2= n\binom{2n-1}{n-1}And at the n+1th step I'm doing this k=1n+1k(nk)2=k=1nk(nk)2+k(nk)2\sum ^{n+1}_{k=1}k\binom{n}{k}^2=\sum ^{n}_{k=1}k\binom{n}{k}^2+ k\binom{n}{k}^2 and then I'm using the inductive hypothesis and I'm getting:n(2n1n1)+n\binom{2n-1}{n-1}+ and I'm stuck right here I don't know how to write k(nk)2k\binom{n}{k}^2, can someone tell me what am I doing wrong.
 
On the second line, the k in the second term on the RHS is n + 1. And I you also have to change the n in the upper "index" of the binomial coefficient when you go up one:
k=1n+1k(n+1k)2=k=1nk(n+1k)2+(n+1)(n+1n+1)2\sum_{k = 1}^{n + 1} k {n + 1 \choose k} ^2 = \sum_{k = 1}^{n} k {n + 1 \choose k} ^2 + (n + 1) {n + 1 \choose n + 1 } ^2
-Dan
 
On the second line, the k in the second term on the RHS is n + 1. And I you also have to change the n in the upper "index" of the binomial coefficient when you go up one:
k=1n+1k(n+1k)2=k=1nk(n+1k)2+(n+1)(n+1n+1)2\sum_{k = 1}^{n + 1} k {n + 1 \choose k} ^2 = \sum_{k = 1}^{n} k {n + 1 \choose k} ^2 + (n + 1) {n + 1 \choose n + 1 } ^2
-Dan
How do I use the inductive hypothesis then?
 
How do I use the inductive hypothesis then?
Someone is going to have to be more clever than me.
(n+1k)=(n+1)!k!(n+1k)!=(n+1)n!k!(n+1k)(nk)!=n+1n+1k(nk){n + 1 \choose k} = \dfrac{(n + 1)!}{k! (n + 1 - k)!} = \dfrac{(n + 1) n!}{k! (n + 1 - k) (n - k)!} = \dfrac{n + 1}{n + 1 - k} {n \choose k}
If we could get the k out of the coefficient on the RHS we could move it outside the summation. But I can't see any way to do that.

-Dan
 
Top