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:

The entire playlist can be found here:

[iamhereblossom]

I just realized this is supposed to be "Discrete Math II". My class is all of Discrete Math 1 and 2 in one semester. No wonder it feels like a lot!

[adnanmohammed]

Thank you! My exam's in about 2 hours and you've been of great help! :)

[ronaldtrump]

Howdy Professor Brehm, thanks a lot for your unbelievable lectures. Now I am ready to take more advanced discrete mathematics.

[ym-lcno]

Excellent examples and explanations. Thank you!