Introduction to Combinatorics
Sets, permutations, combinations, probability, mathematical induction, counting techniques, generating functions, partitions, recurrence relations, inclusion-exclusion. Polya's theorem and applications to computer science, mathematics, engineering and physical sciences. Prerequisite: MATH 31 and MATH 42 (with a grade of "C-" or better in each) or instructor consent.
Normal Grade Rules