This course entails study of the basic principles of combinatorial analysis. Topics include combinations, permutations, inclusion-exclusion, recurrence relations, generating functions, and graph theory. Additional material may be chosen from among the following topics: Latin squares, Hadamard matrices, designs, coding theory, and combinatorial optimization. Satisfies the proof-based requirement in the mathematics major.
Prerequisites: MATH 290 with grade of C- or higher