MATH 450: Combinatorics

MATH 450
Prereqs: MATH 310 or 310H or 325.
Theory of enumeration and/or existence of arrangements of objects: Pigeonhole principle, inclusion-exclusion, recurrence relations, generating functions, systems of distinct representatives, combinatorial designs and other applications.
Credit Hours: 3
Course Format: Lecture 3
Course Delivery: Classroom
Groups: Advanced Mathematics Courses

Attention

This is the site for old bulletin data. Please head to UNL's Course Catalog for updated course and program information.