Elementary Combinatorics

Catalog description

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: 1522 or STAT **345. This is a double-starred (**) level course and may be taken for graduate credit by students enrolled in a graduate program outside of the department. A graduate student enrolled in a double-starred course numbered below 500 may be required to complete extra work.