Wednesday, January 18, 2017

discrete mathematics - Prove sumnk=0k4k=frac49((3n1)4n+1) by induction

Prove that for every position integer n that


nk=0k4k=49((3n1)4n+1)



Proof: Let P(n) denote the above statement.


Base case: n=1 : Note that 1k=1k4k=49((3(1)1)4(1)+1)


49((3(1)1)4(1)+1)=49((2)4+1)=49(8+1)=49(9)=4


k4k=(1)4(1)=4


So P(1) holds.


Inductive Step: Let s1. Assume P(s), so


sk=1k4k=49((3s1)4s+1)


Note


s+1k=1k4k=sk=1k4k+(s+1)4s+1


and by inductive hypothesis:



**


49((3s1)4s+1)+(s+1)4s+1 **


I'm afraid I'm stuck after this point. I know my endpoint needs to be:


s+1k=1k4k=49((3(s+1)1)4s+1+1)


but I don't know how to get from the asterisks to the above. Any help would be greatly appreciated.

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