Ask your own question, for FREE!
Mathematics 21 Online
OpenStudy (anonymous):

Help with mathematical induction?

OpenStudy (anonymous):

Use mathematical induction to prove the statement is true for all positive integers n, or show why it is false. \[1^2 + 4^2 + 7^2 + ... + (3n - 2)^2 = \frac{ n(6n^2 -3n-1) }{2 }\]

OpenStudy (anonymous):

@ParthKohli ?

Parth (parthkohli):

I know how to do this, but I'm really unwell right now. @iambatman Care to help out a fellow batman? :)

OpenStudy (anonymous):

Help.. :/

OpenStudy (anonymous):

DO I need to do n=x+1 after I do n=1? Or do I do the assume thing?

OpenStudy (anonymous):

@RadEn ?????

OpenStudy (anonymous):

@jdoe0001 @Light&Happiness Somebody, please.. ._.

OpenStudy (helder_edwin):

the induction base is: for n=1 left side: \[\large 1^2 =1 \] right side: \[\large \frac{1(6\cdot1^2-3\cdot1-1)}{2}=\frac{6-4}{2}=1. \] so the induction base case is true.

OpenStudy (helder_edwin):

assuming the original statement is true (inductive hypothesis) then we have to prove (inductive thesis): \[\large 1^2+4^2+\dots+(3n-2)^2+(3n+1)^2= \frac{(n+1)[6(n+1)^2-3(n+1)-1]}{2} \]

OpenStudy (helder_edwin):

\[\large =\frac{(n+1)(6n^2+9n+2)}{2} \]

OpenStudy (helder_edwin):

can u dot it?

OpenStudy (anonymous):

Can I what? :p

OpenStudy (helder_edwin):

prove the inductive thesis.

OpenStudy (anonymous):

No... v_v

OpenStudy (anonymous):

How? Does it have something to do with the (3n-2)^2 + (3n+1)^2?

OpenStudy (anonymous):

Ugh, he left. @jim_thompson5910 , or @Hero ?

OpenStudy (anonymous):

@dumbcow , @.Sam.

jimthompson5910 (jim_thompson5910):

It looks like you've already done the case n = 1. So I'll move on Assume the equation holds true when n = k, ie \[1^2 + 4^2 + 7^2 + ... + (3k - 2)^2 = \frac{ k(6k^2 -3k-1) }{2 }\] The goal is to show that the equation also holds true when n = k+1 (based on the assumption that the equation is true when n = k)

OpenStudy (anonymous):

I filled in the n's with n-1, but I don't understand how to finish that step, so I haven't.. @jim_thompson5910

jimthompson5910 (jim_thompson5910):

Plug in n = k+1 to get \[1^2 + 4^2 + 7^2 + ... + (3n - 2)^2 = \frac{ n(6n^2 -3n-1) }{2 }\] \[1^2 + 4^2 + 7^2 + ... + (3(k+1) - 2)^2 = \frac{ (k+1)(6(k+1)^2 -3(k+1)-1) }{2 }\] \[1^2 + 4^2 + 7^2 + ... + (3k - 2)^2 + (3(k+1) - 2)^2 = \frac{ (k+1)(6(k+1)^2 -3(k+1)-1) }{2 }\] \[\sum\left(\text{Terms up to n = k}\right) + (3(k+1) - 2)^2 = \frac{ (k+1)(6(k+1)^2 -3(k+1)-1) }{2 }\] \[\frac{ k(6k^2 -3k-1) }{2 } + (3(k+1) - 2)^2 = \frac{ (k+1)(6(k+1)^2 -3(k+1)-1) }{2 }\] see where this is going?

OpenStudy (anonymous):

Not really...

jimthompson5910 (jim_thompson5910):

ok one sec and I'll write out the rest

OpenStudy (anonymous):

So you are messing with the left side?

jimthompson5910 (jim_thompson5910):

correct, I'm trying to turn the left side into the right side

OpenStudy (anonymous):

So you add the original problem to (3k+1)^2?

jimthompson5910 (jim_thompson5910):

I'm getting stuck though, so I might try manipulating the right side to turn into the left

jimthompson5910 (jim_thompson5910):

ok I think I figured it out, gotta write it up though

OpenStudy (anonymous):

I can't get them to equal up to eachother.. I'm so lost.

jimthompson5910 (jim_thompson5910):

ok, it's quite long and I couldn't get it to fit on here so I made a pdf of the entire process (of just the inductive step, not the n = 1 case, but that's trivial really)

jimthompson5910 (jim_thompson5910):

see attached

jimthompson5910 (jim_thompson5910):

it's definitely a lot, so let me know if you have any questions on it

OpenStudy (anonymous):

What did you do when /you went from:\[(k+1)(6k^2 +12k+6-3k-3-1) \] to:\[(k+1) ((6k^2-3k-1)+12k+6-3)\]?

OpenStudy (anonymous):

Why did it get factored like that?

jimthompson5910 (jim_thompson5910):

when you assume the equation is true for n = k, you get \[1^2 + 4^2 + 7^2 + ... + (3k - 2)^2 = \frac{ k(6k^2 -3k-1) }{2 }\]

jimthompson5910 (jim_thompson5910):

Notice how there's the term \[\Large 6k^2 - 3k - 1\] I pulled that out because I wanted to have k times that over 2

jimthompson5910 (jim_thompson5910):

that way, I would then have the sum from n = 1 to n = k (which is why this all depends on the assumption)

jimthompson5910 (jim_thompson5910):

Here's the template |dw:1399341773005:dw|

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!