Alissa Fong

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

Thank you for watching the video.

To unlock all 5,300 videos, start your free trial.

Mathematical Induction - Problem 4

Alissa Fong
Alissa Fong

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

Share

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!

© 2016 Brightstorm, Inc. All Rights Reserved. Terms · Privacy