Brightstorm is like having a personal tutor for every subject
See what all the buzz is aboutCheck it out
Mathematical Induction - Problem 3 166 views
There are four steps for mathematical induction: first, show your equation is true for the case n = 1, so we plug in 1 for n and show that the inequality is true. Next, we write an assumption that the statement is also true for the kth term, which means substituting k's for all of the n's. Third, we show that the statement is true for the "k + 1"th term, which means adding one to all of the k's in the assumption and then simplifying. 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!