Basic enumeration including combinations, permutations, set and integer partitions, distributions, and rearrangements, binomial and multinomial theorems together with pigeon-hole and inclusion-exclusion principles and mathematical induction principles. Discrete probability, elementary ordinary generating functions, recurrence relations, and sorting algorithms.
Prerequisite: 163 or 181.
Calculus II - MATH 163
Elements of Calculus II - MATH 181