91ÊÓƵ

Prerequisite: MATH 180 with a minimum grade of "C-" and MATH 202 with a minimum grade of "C-" or consent of instructor Methods examined in this course are permutations, combinations, the sum and product rules, ordered and unordered selection with or without repetition, identical and distinct ranges, the pigeonhole principle, binomial coefficients, inclusion/exclusion, derangements, partitions, recurrence relations, generating functions and Ramsey theory. Special topics may include Latin squares, graph theory, network flows, coding theory, designs, polya counting, partially ordered sets and lattices. Offered periodically.