MATH 28 Introduction to Combinatorics

Beginning with techniques for counting-permutations and combinations, inclusion-exclusion, recursions, and generating functions-the course then takes up graphs and directed graphs and ordered sets, and concludes with some examples of maximum-minimum problems of finite sets. Topics in the course have application in the areas of probability, statistics, and computing.

Instructor

Park

Prerequisite

MATH 8.

Degree Requirement Attributes

QDS

The Courses@Dartmouth contains the most up-to-date information about a course. It includes not only the meeting time and instructor, but also its official distributive and/or world culture designation. This information supersedes any information you may see elsewhere, to include what may appear in this ORC/Catalog or on a department/program website. Note that course attributes may change term to term therefore those in effect are those (only) during the term in which you enroll in the course.

Offered

• Winter