Discrete Math II/Combinatorics (Entire course) - Discrete Math II - 5.3.2 Structural Induction

We finish our study in Chapter 5 by examining proof by structural induction. You will find that this method ties in well to the recursive definitions we just studied, and in fact is the best method to prove a characteristic of a recursively defined function. Please be sure you've watched 5.3.1 before watching this video for the background on our first example. Video Chapters: Intro 0:00 What is Structural Induction 0:18 Practice with Me 1:12 Practice on Your Own 5:16 Up Next 9:48 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.sharepoint.com/:f:/g/personal/kbrehm_bellevue_edu/Ei9DcmrOBTlAuMxWUoq9ZqsB14M60jcpob-xdAYS6ruVWw?e=uP9KN0 The entire playlist can be found here: https://www.youtube.com/playlist?list=PLl-gb0E4MII0sGLCJeqDB3y63HZ6lM5LJ