Discrete Math II - 5.2.1 Proof by Strong Induction

In this video we learn about a proof method known as strong induction. This is a form of mathematical induction where instead of proving that if a statement is true for P(k) then it is true for P(k+1), we prove that if a statement is true for all values from 1 to k (or whatever your starting value is), it is true for P(k+1).

Video Chapters:
Intro 0:00
What is Strong Induction? 0:07
Strong Induction with a Range of Values 1:12
Strong Induction with Specific Values 9:29
Up Next 16:14

This playlist uses Discrete Mathematics and Its Applications, Rosen 8e

Power Point slide decks to accompany the videos can be found here:
https://bellevueuniversity-my.sharepo...

The entire playlist can be found here:
   • Discrete Math II/Combinatorics (Entir...