Lecture 12: Counting Problems
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:
http://www.aduni.org/courses/discrete
Licensed under Creative Commons Attribution ShareAlike 2.0:
http://creativecommons.org/licenses/by-sa/2.0/
- Lecture Notes - Lecture Notes from the course
- Problem Set 5 - A problem set with some problems from this lecture
- Problem Set 5 Solutions - Solutions to the Problem Set
- What is a generalized permutation?
- How many different combinations of 5 0s and 1s are possible?
-
Staff Review
This lesson is just a quick recap of the different principles of counting and a brief introduction to generalized permutations. Very little is actually discussed in this short snippet of a lecture. -
