Permutations and k-Permutations (Mathematics for Computer Science)
In today's lesson we learn what a permutation is, how many there are, and even what factorial is! We also explore the question what 0! is and why it equals 1. Finally, we consider k-permutations and how many there are of those for a finite set! We include a good number of examples to go through for both kinds of combinatorial objects.
Time Stamps:
0:00 Recap
0:22 Permutations (what are they), example
6:20 How many permutations of a finite set are there? Definition of factorial
13:10 A reason why 0!=1? How many arrangements are there of an empty set?
17:25 Example 1
22:38 Example 2
26:39 Example 3
31:20 k-Permutations, examples
39:02 How many k-Permutations are there of a finite set A? Defining P(n,k).
46:05 Example 4
49:45 Example 5
53:34 Closing
Have a beautiful day!
Supporters (to date of publication, by tier (top to bottom)):
----------------------------------------------------------
Patreon Supporters (General Support):
Draikou
Patreon Supporters (Basic Support):
Patreon Supporters (Supporter Access!):
Eric R
-----------------------------------------------------------
Become a supporter today! To support my work and mission to provide free or accessible Computer Science education (especially in theory), subscribe to the channel, share my videos. Please donate and contribute to support my work for more content:
PATREON: https://www.patreon.com/PageWizard
SUBSCRIBESTAR: https://www.subscribestar.com/drpage
PAYPAL: https://paypal.me/pagewizard
Follow also at:
FACEBOOK: https://www.facebook.com/DanielRPage
TWITTER: https://twitter.com/PageWizardGLE
QUORA: https://www.quora.com/profile/Daniel-R-Page
TWITCH: https://www.twitch.tv/pagewizard
#ComputerScience
#mathematics
#Combinatorics