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

Prove the statement by mathematical induction. 3 + 5 + 7 + . . . + (2n + 1) = n(n + 2)

OpenStudy (anonymous):

OpenStudy (anonymous):

ever done one of these before?

OpenStudy (anonymous):

Yes, but it has been since the beginning of the year & I'm reviewing now. Even when I first did it I didn't really understand

OpenStudy (anonymous):

i don't think this template is helping with understanding what is going on, but we can work with the template because that is what you have

OpenStudy (anonymous):

Okay, that would be great & thank you in advance!

OpenStudy (anonymous):

the first part, part 1 is rather easy, replace \(n\) by \(1\) and see that you get the same number on both sides of the equal sign

OpenStudy (anonymous):

you get \(1\times (1+2)=3\) on the left, and also \(1+2=3\) on the right

OpenStudy (anonymous):

Sorry my computer froze! & okay, that makes sense. Do you carry the three down to the next line?

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!