Introduction Combinatorics

Catalog description

Mathematical foundation for the concepts and techniques used in combinatorics. Topics include recurrence relations, finite differences, generating functions, pigeonhole principle, special sequences of integers (such as Fibonacci, Sterling and Bell sequences), principle of inclusion and exclusion, and an introduction to the theory of graphs. Applications will be indicated. Offered periodically. Prereq: C- or higher in MATH 322.