Table of contents
- 0. Review of Algebra4h 16m
- 1. Equations & Inequalities3h 18m
- 2. Graphs of Equations1h 31m
- 3. Functions2h 17m
- 4. Polynomial Functions1h 44m
- 5. Rational Functions1h 23m
- 6. Exponential & Logarithmic Functions2h 28m
- 7. Systems of Equations & Matrices4h 6m
- 8. Conic Sections2h 23m
- 9. Sequences, Series, & Induction1h 19m
- 10. Combinatorics & Probability1h 45m
9. Sequences, Series, & Induction
Sequences
7:28 minutes
Problem 21b
Textbook Question
Textbook QuestionIn Exercises 11–24, use mathematical induction to prove that each statement is true for every positive integer n. 1 · 2 + 2 · 3 + 3 · 4 + ... + n(n + 1) = n(n + 1)(n + 2)/3
Verified Solution
This video solution was recommended by our tutors as helpful for the problem above
Video duration:
7mPlay a video:
64
views
Was this helpful?
Related Videos
Related Practice
Showing 1 of 7 videos