An introduction to counting techniques of discrete objects. The enumeration of sets, permutations and combinations, the binomial and multinomial theorem will serve as an appetizer; counting methods including the inclusion-exclusion principle; the pigeonhole principle, generating functions, and recurrence relations will be the main course. Applications of combinatorial techniques and problem solving will be emphasized. [Optional: finite geometries, permutation groups, latin squares, designs, and codes.]
- [MATH-225] Foundations of Higher Mathematics -- with a grade of at least C.
2019 Spring-- E. Nastase.
2017 Spring-- E. Nastase.
2015 Spring-- E. Nastase.