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

Use mathematical induction to prove the statement is true for all positive integers n, or show why it is false.

OpenStudy (anonymous):

4 ⋅ 6 + 5 ⋅ 7 + 6 ⋅ 8 + ... + 4n( 4n + 2) =

OpenStudy (anonymous):

4 ⋅ 6 + 5 ⋅ 7 + 6 ⋅ 8 + ... + 4n( 4n + 2) = [4(4n+1)(8n+7)]/6

OpenStudy (anonymous):

isn't the pattern supposed to be (n+3)(n+5)?

OpenStudy (anonymous):

that was the question that was given to me so i wouldn't know

OpenStudy (anonymous):

there is no such n that will give you 5(7) or 6(8) with 4n(4n+2) because 4n is a multiple of 4. so it should have been 4(6) + 8(10) + 12(14) + ... + 4n(4n+2) I would say false.

OpenStudy (anonymous):

ok since its false i then have to show why its false

OpenStudy (anonymous):

let n = 1, then sum is the first term 4(6) = 24 but when you plug 1 in for n [4(4n+1)(8n+7)]/6, you get 50

OpenStudy (anonymous):

so it doesn't work for all positive integer

OpenStudy (anonymous):

and that would be it?

OpenStudy (anonymous):

I would say so, unless there is something that is supposed to be understood but was not explicitly stated in the question.

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!