Mathematical Induction with Sigma notation

NotChelsea
Messages
2
Reaction score
0
Prove by mathematical induction that

n
sigma r^3 = n^2(n+1)^2/4
r = 1

so far I have

1
sigma r^3 = 1^2(1+1)^2/2
r=1

1 = 1(4)/2

1 = 4/2

1 = 2

I'm not sure what to do after this for the k+1 case.
 
Last edited:
Physics news on Phys.org
Hello, and welcome to MHB! (Wave)

Your induction hypothesis $P_n$ is:

$$\sum_{r=1}^{n}\left(r^3\right)=\frac{n^2(n+1)^2}{4}$$

As your induction step, I would suggest adding $$(n+1)^3$$ to both sides...

edit: I just noticed you have an error in your check of the base case $P_1$...can you spot it?
 
ummmm is it because of the "1 = 2"?
 
The "1=2" happened because you divided by 2 instead of 4.
 
NotChelsea said:
Prove by mathematical induction that

n
sigma r^3 = n^2(n+1)^2/4
r = 1

so far I have

1
sigma r^3 = 1^2(1+1)^2/2
r=1
As Opalg pointed out, in your original formula you have "/4" but have accidently changed that to "/2".

1 = 1(4)/2

1 = 4/2

1 = 2
which is NOT true! But with "4" in the denominator as in the original formula this becomes 1= 1(4)/4 which is true.

I'm not sure what to do after this for the k+1 case.
The reason so many induction problems involve sums is that then the "k+1" case is just the "k" case plus the next term!

With n= k+ 1 you have
[math]\sum_{r=1}^{k+1} r^3= \sum_{r= 1}^k r^3+ (k+1)^3[/math]
[math]= k^2(k+1)^2/4+ (k+1)^3[/math].

Factor [math](k+1)^2[/math] out of that to get
[math]= (k+1)^2(k^2/4+ k+ 1)= (k+1)^2(k^2+ 4k+ 4)/4[/math]

And now you just have to observe that [math]k^2+ 4k+ 4= (k+ 2)^2= ((k+1)+1)^2[/math] so that [math](k+1)^2(k^2+ 4k+ 4)/4= (k+1)^2((k+1)+1)^2/4[/math]
really is "[math]n^2(n+1)^2/4[/math]" with n= k+ 1.
 
ohhhh I see it now. Thank you so much!
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Back
Top