Discrete Math II - 5.1.1 Proof by Mathematical Induction

Though we studied proof by induction in Discrete Math I, I will take you through the topic as though you haven't learned it in the past. The premise is that we prove the statement or conjecture is true for the least element in the set, then show that if the statement is true for the kth element, it is true for the (k+1)th element. We will go through just one example and show the steps used for a proper proof. The follow-up video for section 5.1 is all practice proofs.

Video Chapters:
Intro 0:00
What is Mathematical Induction 0:07
Well-Ordering Principle 2:02
Back to Induction 4:19
Guided Practice Proof 5:16
Up Next 12:54

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