MATH 3100 APPLIED COMBINATORICS (3 credits)
Basic counting methods, generating functions, recurrence relations, principle of inclusion-exclusion. Polya's formula. Elements of graph theory, trees and searching network algorithms. (Cross-listed with MATH 8105, CSCI 3100, CSCI 8105).
Prerequisite(s): MATH 2030, MATH 2040, MATH 2230, or CSCI 2030 all with a C- or better. Mathematical logic; Set theory; Relations; Functions; Congruences; Inductive and recursive definitions; Discrete probability; sets, graphs, trees, & matrices