MATH 3U03

COMBINATORICS

Undergraduate

Fall 2026 · C01

Readings

How To Count: An Introduction To Combinatorics And Its Applications
Beeler · Required
ISBN 9783319355085

Fall 2026 · C01

Preliminaries: Sets, functions, Pigeonhole Principle, Combinatorial proofs (Chapter 1)
Basic Counting: Addition and Multiplication Principles, permutations, Stirling numbers of the First Kind and their applications (Chapter 2)
Binomial Coefficient: identities, stars and bars, multinomial coefficient, and applications (Chapter 3)
Distribution problems and Stirling numbers of the second kind (Chapter 4)
Generating functions (Chapter 5)
Methods for recurrence relations (Chapter 6) and Principle of Inclusion-Exclusion (Chapter 7)
Time permitting some applications to Combinatorial Design and Graph Theory (Chapters 10 and 11)

How to Count An Introduction to Combinatorics and Its Applications
Robert A. Beeler · 2016-10-29 · 1 · Required
Springer International Publishing · ISBN 9783319355085
How to Count An Introduction to Combinatorics and Its Applications ISBN: 9783319355085 Authors: Robert A. Beeler Publisher: Springer International Publishing Publication Date: 2016-10-29 Edition: 1 Available online through the McMaster library.
See source

Winter (schedule dates) 2017

Sources