Middlebury

MATH0345A-S20

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.
Course Reference Number (CRN):
22285
Subject Code:
MATH
Course Number:
0345
Section Identifier:
A

Course

MATH 0345

All Sections in Spring 2020

Spring 2020

MATH0345A-S20 Lecture (Schmitt)