SOLUTION: Prove by induction that for all n that are positive natural numbers: (Signma n, i=1) i^3 = ((n(n-1))/2)^2 Comments: I have proved it for the base case, however, I am unsure

Algebra ->  Problems-with-consecutive-odd-even-integers -> SOLUTION: Prove by induction that for all n that are positive natural numbers: (Signma n, i=1) i^3 = ((n(n-1))/2)^2 Comments: I have proved it for the base case, however, I am unsure      Log On


   

Question 839541: Prove by induction that for all n that are positive natural numbers:
(Signma n, i=1) i^3 = ((n(n-1))/2)^2


Comments: I have proved it for the base case, however, I am unsure as to how I should proceed. Any help would be much appreciated, I am really trying hard to understand induction. Thank you SO much.
Answer by richard1234(7193) About Me  (Show Source):
You can put this solution on YOUR website!
Assume that the summation holds for some n = k, where k >= 1. Prove that it must hold for n = k+1. Then by induction, you are done, because n = 1 implies that the summation holds for n = 2, which implies that the summation holds for n = 3, etc.