Discrete Math: Counting Theory

Learn about counting theory and its relevance to computer science, and dive into the pigeonhole principle.
Continue your Discrete Math learning journey with Discrete Math: Counting Theory. Learn about the important rules of counting theory, some interesting patterns, and the application of counting theory in computer science. Use Python sets to represent and solve various counting problems.



### Skills you’ll gain
- Learn about Pascal's Triangle
- Use counting rules
- Solve problems using Python

### Notes on Prerequisites
We recommend that you complete [Discrete Math: Permutations and Combinations](https://www.codecademy.com/learn/discrete-math-permutations-and-combinations) before completing this course

• Counting Theory: Learn about counting theory.
• Lesson: Counting Theory: Lesson
• Article: Counting Theory: Pigeonhole Principle
• Quiz: Counting Theory: Quiz
• Article: Counting Theory: Problem Set
• Informational: Next Steps