MTH 3270 - Combinatorics

Institution:

Belmont University

Subject:

Description:

Prerequisite: MTH 2250 or CSC 2250. A continuation of the introduction to combinatorics begun in MTH 2250. Topics include the principles of counting patterns by means of generating functions, recurrence relations, and Polya's Theory; the existence of patterns by means of the pigeonhole principle and its generalizations; and the optimization of patterns by means of the minimax principle.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.belmont.edu

Phone Number:

(615) 460-6000

Regional Accreditation:

Southern Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.