Unit
Sequences and Series
MA, Stanford University
Teaching in the San Francisco Bay Area
Alissa is currently a teacher in the San Francisco Bay Area and Brightstorm users love her clear, concise explanations of tough concepts
To unlock all 5,300 videos, start your free trial.
MA, Stanford University
Teaching in the San Francisco Bay Area
Alissa is currently a teacher in the San Francisco Bay Area and Brightstorm users love her clear, concise explanations of tough concepts
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!
