21-301 Combinatorics

9 units, Carnegie Mellon University

A major part of the course concentrates on algebraic methods, which are relevant in the study of error correcting codes, and other areas. Topics covered in depth include permutations and combinations, generating functions, recurrence relations, the principle of inclusion and exclusion, and the Fibonacci sequence and the harmonic series. Additional topics may include existence proofs, partitions, finite calculus, generating combinatorial objects, Polya theory, codes, probabilistic methods. (Three 50 minute lectures)

Prerequisites: 21-122 and (21-228 or 15-251)

Offered: Spring 2027, Fall 2026, Spring 2026, Fall 2025

Courseweave needs JavaScript to show sections, workloads and planning tools.