I am trying to understand how to write mathematical induction proofs. This is my first attempt.
Prove that the sum of cubic positive integers is equal to the formula
n2(n+1)24. I think this means that the sum of cubic positive integers is equal to an odd number. However, let's go on proving...
1) I start by proving the base case n=1 and I show that the formula holds.
2) I assume than any number k other than 1, which appartains at N, holds for the formula and I write the same formula but with k which replaces n.
3) For mathematical induction, I assume that the formula holds also for k+1 = n
So, the left side of the equation should be:
k+1∑i=1i3=13+23+33+...+(k+1)3
I am wondering about which one of these 2 forms (equivalents, I think) should have the right side :
this one, with k+1 in place of the n of the original formula / or k in the second version: (k+1)2[(k+1)+1]24 or this one: k2(k+1)24+(k+1)3 ?
I think that, in order for the proof to be convincing, we should write an equivalent statement for the original form of the formula, namely n∑i=1i3=n2(n+1)24 and perhaps we do it by showing that after algebraic passages k2(k+1)24+(k+1)3 is equal to (k+1)2[(k+1)+1]24 ?
Sorry for my soliloquy but it helps to understand and I would appreciate confirmation from you!
Answer
Your inductive assumption is such that the formula marked red (several lines below) holds for i=k: i=k∑i=1i3=k2(k+1)24
You need to prove that for i=k+1: i=k+1∑i=1i3=(k+1)2(k+2)24
To do this you cannot use: i=n∑i=1i3=n2(n+1)24 as this is what you are trying to prove.
So what you do instead is notice that:
i=k+1∑i=1i3=k2(k+1)24⏟sum of k terms+(k+1)3⏟(k+1)th term
i=k+1∑i=1i3=(k+1)2(14k2+(k+1))
i=k+1∑i=1i3=(k+1)2(k2+4k+44)
i=k+1∑i=1i3=(k+1)2((k+2)24)=(k+1)2(k+2)24
Which is the relation we set out to prove. So the method is to substitute i=k+1 into the formula you are trying to prove and then use the inductive assumption to recover the blue equation at the end.
No comments:
Post a Comment