Like what you saw?
Create FREE Account and:
- Watch all FREE content in 21 subjects(388 videos for 23 hours)
- FREE advice on how to get better grades at school from an expert
- FREE study tips and eBooks on various topics
Mathematical Induction - Problem 3
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!
Please enter your name.
Are you sure you want to delete this comment?
Sample Problems (6)
Need help with a problem?
Watch expert teachers solve similar problems.
Problem 1 6,639 views
1 + 2 + 3 +....... n = n(n + 1) 2
Problem 2 5,430 views
Prove:1 + 3 + 5 +.....(2n - 1) = n²
Problem 3 994 views
Problem 4 873 views
Problem 5 884 views
Problem 6 945 views