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 ...
