In Lecture 14, you'll learn how to solve counting problems using combinations and distributions. The instructor presents a problem that doesn't appear in any books or problem sets - how many ways are there to order any subset of elements from a set of n? He goes through different cases and shows that the answer is between 2 and 3 times n factorial. The lecture also briefly covers probability and how to calculate the chance of something happening using counting methods.
Learn about and solve counting problems using combinations and distributions.
More information about this course:
http://www.aduni.org/courses/discrete
Licensed under Creative Commons Attribution ShareAlike 2.0:
http://creativecommons.org/licenses/by-sa/2.0/