Posted by Lucy on Saturday, January 3, 2009 at 11:46am.
Step 1
show it to be true for n=1
LS = 1^2 = 1
RS = (1)(2)(3)/6 = 1, checks out
Step 2
Assume it is true for n=k
that is..
1^2 + 2^2 + 3^2 + ... + k^2 = k(k+1)(2k+1)/6
Step 3
is it then true for n = k+1 ??
or
is 1^2 + 2^2 + 3^2 + ... + k^2 + (k+1)^2 = (k+1)(k+2)(2k+3)/6 ??
from Step 2 the sum of terms to the end of k^2 = k(k+1)(2k+1)/6
then
LS = k(k+1)(2k+1)/6 + (k+1)^2
= (k(k+1)(2k+1) + 6(k+11)^2)/6
= (k+1)(k(2k+1) + 6(k+1))/6
= (k+1)(2k^2 + k + 6k + 6)/6
= (k+1)(k+2)(2k+3)/6
= RS
Q.E.D.
compare your solution to mine.
Where you not shown the 3step process of an induction proof?
Related Questions
AP Calc - Use mathematical induction to prove that the statement holds for all ...
Calculus - Use mathematical induction to prove that each proposition is valid ...
Calculus - Use mathematical induction to prove that the statement holds for all ...
Math - Mathematical Induction - 3. Prove by induction that∑_(r=1)^n&...
Math - Use mathematical induction to prove that 2^(3n) - 3^n is divisible by 5 ...
mathematical induction - solve this using the mathematical induction : 1/1(3)+1/...
PRE CAL SEQUENCES - Given the following finite sum 1/(1*2)+1/(2*3)+1/(3*4)+1/(4*...
Discrete Math - Use mathematical induction to prove the truth of each of the ...
math - *if it is in parentheses, it is subscripted. the sequence {a(n)} is ...
Math - Use Mathematical Induction to show that the statement 2 + 6 + 10...
For Further Reading