Publication Date

2022

Course Name

Combinatorics

Abstract

Basic counting principles including permutations, combinations, the multiplication and addition rules, and the pigeonhole principle; distribution problems; combinatorial proofs; counting the complement and inclusion-exclusion arguments; breaking counting problems down into smaller subproblems; generating functions; permutation groups and Polya’s enumeration theorem; combinatorial block designs.

Share

COinS
 

Archival Statement

This material is part of a digital archival collection. This item was created or digitized prior to April 24, 2026, or is a reproduction of physical media created before that date. It is preserved specifically for research, reference, or historical recordkeeping. In accordance with the ADA Title II regulations, Butler Library provides accessible versions of archival materials upon request for affiliated faculty, staff, and students. To request an accommodation for this item, please submit a remediation request form.