Combinatorics is a beautiful and foundational subject. It deals with the study of discrete objects and the art of counting them. Combinatorial arguments make appearances in all the fields of mathematics. Combinatorics is also a keystone of modern computer science. This course provides an introduction to some aspects of combinatorics, including counting, graph theory and generating functions.
Office Hours: Thursdays 1:30-3:30 (Math 229)
Homework:
1) 1.2.1, 1.2.6, 1.3.2, 1.3.4, 1.4.2, 1.6.3 (Due 9/2)
2) 2.1.4 a b, 2.2.7 a, 2.2.9 a b c, 3.1.4, 3.3.3, 3.5.3 (Due 9/16)
3) 3.7.3, 3.7.4, 4.1.3, 4.2.1, 4.2.2, 4.3.9 (Due 9/23)
4) 3.7.5, 3.7.6, 4.2.4, 4.3.7, 4.4.2, 4.6.1 (Due 9/30)
5) 5.1.2, 5.1.3, 5.1.4, 5.1.5, 5.1.6 (Due 10/14)
6) 5.2.2, 5.4.3, 5.4.4, 6.2.1, 6.3.3 (Due 10/21)
7) 6.4.1, 6.4.4, 7.1.2, 7.1.3 (Due 10/28)
8) 4.2.5, 8.1.1, 10.1.2 a), 10.1.3, 10.2.1 (Due 11/4)
9) 10.2.4, 10.3.4, 10.4.2 (Due 11/11)
10) 12.1.1, 12.1.2, 12.1.3, 12.1.6, 12.2.1 (Due 12/7)