I am having problems solving the second step. I have proven that n=1 in the first step.
I have to prove each given statement through mathematical induction.
http://i53.tinypic.com/34phphc.gif
Help would be greatly appreciated (Nod) Thank you
Printable View
I am having problems solving the second step. I have proven that n=1 in the first step.
I have to prove each given statement through mathematical induction.
http://i53.tinypic.com/34phphc.gif
Help would be greatly appreciated (Nod) Thank you
So now use the assumption n=k to prove n=k+1
n=k
n=k+1
Using n=k for n=k+1
However, to add to what pickslides has written,
you need to be aware of what you should end up with when you evaluate that sum!
You are attempting to show that
"if"