In this lesson on counting problems, the instructor covers the basics of combinatorics, including the addition principle, multiplication principle, and complement principle. He then moves on to more advanced principles such as combinations, permutations, and the inclusion exclusion theorem. Finally, he introduces the pigeonhole principle and how it can be applied to counting problems. The lesson ends with a discussion of how these principles can be applied to probability questions, specifically those related to discrete probability.
Learn about combinatorics in this brief recap of counting principles.
More information about this course:
Licensed under Creative Commons Attribution ShareAlike 2.0: