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
- Attend and watch FREE live webinar on useful topics
Mathematical Induction - Problem 4
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
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!
Stuck on a Math Problem?
Ask Genie for a step-by-step solution
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,088 views
1 + 2 + 3 +....... n = n(n + 1) 2
Problem 2 4,994 views
Prove:1 + 3 + 5 +.....(2n - 1) = n²
Problem 3 711 views
Problem 4 609 views
Problem 5 628 views
Problem 6 651 views