Brightstorm is like having a personal tutor for every subject

See what all the buzz is about

Check it out
Don't Stop Learning Now!

Gain access to 3,500 HD videos.

Convince me!

Watch 1 minute preview of this video


Get Immediate Access with 1 week FREE trial
Your video will begin after this quick intro to Brightstorm.

Mathematical Induction - Problem 5 219 views

For math induction, 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, rewriting all of your k's with "k+1's" , 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!