Saturday, February 25, 2017

discrete mathematics - Induction on a sum



The left hand side has terms involving
(nm)=n!(nm)!m!



1+12(n1)+13(n2)+...........+1n+1(nn)=2n+11n+1




I've done induction and proved P(0) holds and also P(1),P(2) holds (Just in case)



Now I've found P(K+1) so the sum on the left is going to equal 2n+11n+1 + 1n+2



and the right hand side is going to equal 2n+21n+2



My problem is coming with the algebra though. I can't get those sides to equal. I can't get rid of the n+1 in the denominator.



Anyone have any ideas for me? They'd be much appreciated!




P.S. Someone gave me a hint and said that you can use the binomial theorem to solve this.


Answer



Recall that
(1+x)n=nk=0(nk)xk
Integrating this from 0 to 1, gives us
(1+x)n+1n+1|10=nk=0(nk)xk+1k+1|10
Hence, we get what you want.


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