Preview Workflow

The CIM Courses system will be down temporarily undergoing routine maintenance.

Viewing: MATH 3613 : Introduction to Combinatorics

Last approved: Tue, 09 May 2017 08:03:44 GMT

Last edit: Fri, 05 May 2017 17:22:33 GMT

Catalog Pages referencing this course
Programs referencing this course
Columbian College of Arts and Sciences
Mathematics (MATH)
MATH
3613
Introduction to Combinatorics
Introduction to Combinatorics
Fall 2017
3
Course Type
Lecture
Default Grading Method
Letter Grade

No
No
MATH 2971 or MATH 2971W
Corequisites

30

Frequency of Offering

Term(s) Offered

Are there Course Equivalents?
No
 
No
Fee Type


No


Introduction to combinatorial enumeration; basic counting techniques, inclusion–exclusion principle, recurrence relations, generating functions, pigeonhole principle, bijective correspondences.
As a result of completing this course, students will be able to:
(1) devise combinatorial proofs of a wide range of identities,
(2) deduce combinatorial information by manipulating generating functions,
(3) apply basic techniques, such as inclusion-exclusion, to solve counting problems.

Course Attribute
CCAS - GCR: Q & L
Updated 04/13/2017
candaceg (Tue, 21 Feb 2017 18:30:41 GMT): Rollback: Please add university policies to your syllabus. template attached for further guidance.
Key: 5772