MATH 315 - Combinatorics

Credit(s): 3
Lecture: 3
Non-Lecture: 0
As calculus seeks to develop proficiency in analysis problem solving, the aim of this course is to develop proficiency in basic combinatorial problem solving and reasoning. Topics include: Enumeration, generating functions, sieve formulas, recurrence relations, graph theory, network analysis, trees, search theory, and block designs. Offered fall, even years.

Prerequisite(s): MATH 222, MATH 233 and either MATH 237 or MATH 239.