Part: Set-theoretic Prerequisites Needed For Combinatorics

In this part, we will recap some basic results from set theory, which are necessary to really understand combinatorics. First of all, please check if you are already acquainted with the following results:

Explanations: 1 2 3

  1. Proposition: Indicator Function and Set Operations
  2. Proposition: Fundamental Counting Principle
  3. Theorem: Inclusion-Exclusion Principle (Sylvester's Formula)
  4. Proposition: Recursively Defined Arithmetic Functions, Recursion

Thank you to the contributors under CC BY-SA 4.0!