Discrete Math II - 6.3.1 Permutations

In this video we will take a look at developing the concept of permutations. It is important to note that instead of giving you 100 examples on how to apply the formula for a permutation, I spent some time developing where that formula came from. It may seem excessive, but that development will help us as we move through the rest of this course.

Video Chapters:
Intro 0:00
Brute-Force Example Using All Objects 0:06
Factorial Example Using All Objects 2:04
Arriving at the Formula for Permutations Using "k" Objects 4:22
Formula for Permutations 9:05
Example Using Formula 10:20
0!=1 12:03
Two "Different" Examples 13:10
Up Next 15:40

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:

[allphotoscloud]

part 2 of commenting on all the videos in this series as you deserve it for your hardwork. Not only me but even random people I meet who happen to take discrete math 1 and 2 just coincidentally during the conversation bring you up because you are the universal study guide for discrete math. What an amazing teacher you are.

[diegorubino]

thank you so much for these series, theyre all complete and utter life savers

[ericjacobs]

Thank you for putting this out there. This course is a wonderful overview of the subject. I've gone through the material in my course and it felt disjointed. Nice to piece it together with your playlist.

[hessah]

On the last question isn’t it supposed to be P(5, 5)?
Since n=6 & one of the elements stays the same ?