Useful Links
Mathematics
Combinatorics
1. Introduction to Combinatorics
2. Fundamental Counting Principles
3. Permutations
4. Combinations
5. The Binomial Theorem
6. Advanced Counting Techniques
7. Recurrence Relations
8. Generating Functions
9. Special Counting Numbers and Sequences
10. Graph Theory and Combinatorics
11. Design Theory
12. Probabilistic Combinatorics
13. Algebraic Combinatorics
14. Extremal Combinatorics
15. Applications and Advanced Topics
Advanced Counting Techniques
The Principle of Inclusion-Exclusion
Statement and Motivation
Two Sets Case
Three Sets Case
General Formula for n Sets
Venn Diagram Interpretation
Applications
Counting Surjective Functions
Derangement Problems
Elements with Multiple Properties
Euler's Totient Function
The Pigeonhole Principle
Simple Pigeonhole Principle
Generalized Pigeonhole Principle
Strong Form of Pigeonhole Principle
Applications
Existence Proofs
Bounds and Extremal Arguments
Number Theory Applications
Geometric Applications
Previous
5. The Binomial Theorem
Go to top
Next
7. Recurrence Relations