We use the Fundamental Principle of Counting.

We use partitions to enumerate sets.

We use complements to enumerate sets.

We define and enumerate permutations.

We define and enumerate combinations.

We define and enumerate circular permutations.

We define and enumerate combinations of multisets.

We use combinatorial reasoning to prove identities.

We explore the Binomial Theorem.

We explore the Multinomial Theorem.

We explore Newton’s Binomial Theorem.

We use De Morgan’s Law to enumerate sets.

We use the Inclusion-Exclusion Principle to enumerate sets.

We use the Inclusion-Exclusion Principle to enumerate derangements.

We use the Inclusion-Exclusion Principle to enumerate relative derangements.

We present a formula for Euler’s $\phi$ function.

We will explore special sequences.

We will define, create and interpret generating functions.

We utilize exponential generating functions

We use the Pigeon Hole Principle

We compute Ramsey numbers in small cases