Useful Links
Mathematics
Discrete Mathematics
1. Foundations of Logic and Proofs
2. Set Theory and Basic Structures
3. Combinatorics
4. Number Theory
5. Graph Theory
6. Trees
7. Discrete Probability
8. Algorithms and Complexity
9. Boolean Algebra and Logic Circuits
Combinatorics
Fundamental Counting Principles
Addition Principle
Basic Addition Rule
Mutually Exclusive Events
Applications and Examples
Multiplication Principle
Basic Multiplication Rule
Sequential Choices
Applications and Examples
Inclusion-Exclusion Principle
Two-Set Case
Three-Set Case
General Formula
Applications to Counting Problems
Pigeonhole Principle
Basic Pigeonhole Principle
Generalized Pigeonhole Principle
Applications and Examples
Permutations
Basic Permutations
Permutations without Repetition
Formula and Calculation
Permutations with Restrictions
Permutations with Repetition
Circular Permutations
Permutations with Forbidden Positions
Partial Permutations
r-Permutations
Formula and Applications
Combinations
Basic Combinations
Combinations without Repetition
Binomial Coefficients
Formula and Calculation
Combinations with Repetition
Stars and Bars Method
Multiset Combinations
Properties of Combinations
Symmetry Property
Pascal's Identity
Other Identities
Binomial Theorem and Identities
Binomial Theorem
Statement and Proof
Pascal's Triangle
Construction and Properties
Patterns in Pascal's Triangle
Binomial Identities
Vandermonde's Identity
Hockey Stick Identity
Sum Identities
Advanced Counting Techniques
Generating Functions
Ordinary Generating Functions
Operations on Generating Functions
Applications to Counting
Recurrence Relations
Linear Homogeneous Recurrences
Characteristic Equation Method
Non-homogeneous Recurrences
Fibonacci Sequence
Applications and Examples
Derangements
Definition and Formula
Inclusion-Exclusion Derivation
Stirling Numbers
Stirling Numbers of the Second Kind
Stirling Numbers of the First Kind
Previous
2. Set Theory and Basic Structures
Go to top
Next
4. Number Theory