Prove, by mathematical induction, that (1^3) + (2^3) + (3^3) + ... + (n^3) = ((n(n+1))/2)^2 for all integers n≥1 I got to here (below) and am stuck... (1^3) + (2^3) + (3^3) + ... + ((n+1)^3) = (((n(n+1))/2)^2) + (n+1)^3
Follow Math Help Forum on Facebook and Google+
Originally Posted by bearej50 Prove, by mathematical induction, that (1^3) + (2^3) + (3^3) + ... + (n^3) = ((n(n+1))/2)^2 for all integers n≥1 I got to here (below) and am stuck... (1^3) + (2^3) + (3^3) + ... + ((n+1)^3) = (((n(n+1))/2)^2) + (n+1)^3 Hi bearej50, P(k) ? P(k+1) if the first statement is true, and this must equal Proof hence P(k+1) is valid if P(k) is, hence test for an initial value N.
View Tag Cloud