Base case:   = 1

             =  = 1



Base case holds.





Hypothesis:  

Assume  + ... +  =  for n=k.  (*)





Step case:  Let n=k+1

 [  + ... +  ] +  



... use hypothesis on terms within [  ] ...



=  + 



... this reduces to (you can factor  then use a factoring website for the rest) ...  (see NOTE)



= 



The proof is complete here, but it is not obvious, so

let u=k+1 --> k=u-1



= 

= 



Proof complete



NOTE:  I admit, there may be an easier path here.  If other tutors (or the student) wish to find it, more power to them.  I gave the general idea...



If this helps the student, thanks are appreciated.  

    

RELATED QUESTIONS

use the principals of mathematical induction to prove the following statement... (answered by greenestamps)

Mathematical induction


How can we prove that :
(1 + 1 / 3) (1 + 5 / 4)(1 + 7 /... (answered by ikleyn)

Induction
1^3+3^3+5^3+...+(2n-1)^3 =... (answered by ikleyn)

Prove by mathematical induction,1^2+3^2+....(2n+1)^2=((n+1)(2n+1)(2n+3))/3 where 'n' is a  (answered by ikleyn)

Use mathematical induction to prove:  4^n+1 + 5^2n-1 is divisible by... (answered by jim_thompson5910,Edwin McCravy)

Please help with this questions, prove by induction that the formulas positive integral... (answered by ikleyn)

{{{ 1/ (2n^2) }}} + {{{ 5 / 2n }}} = {{{ (n-2) / n^2... (answered by ankor@dixie-net.com)

Using mathmatical induction(two step process),, prove the formula... (answered by Jk22)

Prove by mathematical induction
1^2+3^2+5^2+.......upto n terms =... (answered by rothauserc)