Middlebury
header image

MATH0345

Combinatorics

Combinatorics
Combinatorics is the “art of counting.” Given a finite set of objects and a set of rules placed upon these objects, we will ask two questions. Does there exist an arrangement of the objects satisfying the rules? If so, how many are there? These are the questions of existence and enumeration. As such, we will study the following combinatorial objects and counting techniques: permutations, combinations, the generalized pigeonhole principle, binomial coefficients, the principle of inclusion-exclusion, recurrence relations, and some basic combinatorial designs. (MATH 0200 or by waiver) 3 hrs. lect./disc.
Subject:
Mathematics
Department:
Mathematics
Division:
Natural Sciences
Requirements Fulfilled:
DED
Equivalent Courses:

Sections

Spring 2015

MATH0345A-S15 Lecture (Schmitt)

Fall 2012

MATH0345A-F12 Lecture (Schmitt)

Fall 2010

MATH0345A-F10 Lecture (Schmitt)

Spring 2009

MATH0345A-S09 Lecture (Schmitt)

Fall 2006

MATH0345A-F06 Lecture (Schmitt)