The Art of Counting
Free, no sign-up neededSpring 2003English
About this course
The subject of enumerative combinatorics deals with counting the number of elements of a finite set. For instance, the number of ways to write a positive integer n as a sum of positive integers, taking order into account, is 2n-1. We will be concerned primarily with bijective proofs, i.e., showing that two sets have the same number of elements by exhibiting a bijection (one-to-one correspondence) between them.
Description from MIT OpenCourseWare.
Where to take this course
- Open MIT OpenCourseWare (new tab)MIT OpenCourseWare · Spring 2003