Like what you saw?
Start your free trial and get immediate access to:
Watch 1-minute preview of this video

or

Get immediate access to:
Your video will begin after this quick intro to Brightstorm.

Mathematical Induction - Problem 4 288 views

First, show your equation is true for the case n = 1 by substituting in one. Next, we write an assumption that the statement is also true for the kth term and replace all n's with k's. Third, we show that the statement is true for the "k + 1"th term, which means adding one more term, substituting what you had written when you assumed for k, and the simplifying. Finally, showing that the statement is true for "k + 1 " terms is sufficient to prove that it is true for all values of n.

Transcript Coming Soon!

Stuck on a Math Problem?

Ask Genie for a step-by-step solution