Thread: Inductive reasoning

Sort of lost on how to continue...
Prove that the following formula is true for all n using inductive reasoning 3 + 7 + 11 + .... +(4n - 1) = n(2n + 1)

n = 1 is true
assume k1 is true? (4k - 1) = k(2k + 1)
now to prove k + 1

[4(k+1) - 1] + (4k - 1) = k(2k + 1) + [4(k+1) - 1]

Would someone mind showing me where to go from here?

hi-

i think u are on the right track.
continue.

Just a step and u are there!

Originally Posted by Såxon

Sort of lost on how to continue...
Prove that the following formula is true for all n using inductive reasoning 3 + 7 + 11 + .... +(4n - 1) = n(2n + 1)

n = 1 is true
assume k1 is true? (4k - 1) = k(2k + 1)
now to prove k + 1

[4(k+1) - 1] + (4k - 1) = k(2k + 1) + [4(k+1) - 1]

Would someone mind showing me where to go from here?

you mean



let

is true and is true suppose that P(k) is true lats try

true or not



and the red term equal from P(k) so you will have

and this equal the blue term the proof ends

By the way, "proof by induction", which is what is meant here, and "inductive reasoning" are not at all the same thing!

Originally Posted by Såxon

Sort of lost on how to continue...
Prove that the following formula is true for all n using inductive reasoning 3 + 7 + 11 + .... +(4n - 1) = n(2n + 1)

n = 1 is true
assume k is true: 3 + 7 + 11 + .... +(4k - 1) = k(2k + 1)
now to prove k + 1

3 + 7 + 11 + .... +(4k - 1)+[4(k+1) - 1] + (4k - 1) = k(2k + 1) + [4(k+1) - 1]

Would someone mind showing me where to go from here?

I've added some parts that should be there -- I can't tell if you omitted them for less typing, or weren't sure that they should be there.

You want to show that the last thing you typed: k(2k + 1) + [4(k+1) - 1] is equal to (k+1)(2(k+1) + 1), for the inductive statement to be true.

Show that as Amer did: