Textbook (for reference only): Combinatorics: Topics, Techniques, Algorithms by peter J. Cameron. You can find it in WM bookstore or Amazon.com.
Course goal: An introductory course to combinatorics. We will cover a wide range of topics such as subsets, partitions and permutations, recurrence relations and generating functions, inclusion and exclusion, latin squares, Steiner triple systems, and graph theory.
Homework: Weekly homework sets will be given. Students are encouraged to work in groups to discuss ideas, but everyone must write his own solutions. Homework solutions should be typed (using Latex).
Homework help session: Friday 9:30-10:30pm at Jones 131 (Tentative)
Exam: There is no midterm exam. A final exam (take-home or not to be decided later) will be given.
Attendance: Regular attendance is critical for your success in this course. I expect your presence at every lecture.
Grading: Your final grade is calculated as follows:
Homework 60%
Final Exam: 40%
The letter grade is assigned using the scale:
A > 93 > A- > 90 > B+ > 87 > B > 83 > B- > 80> C+ > 77 > C > 73 > C- > 70 > D+ > 67 > D > 63 > D- > 60 > F
Honor Code: Students will uphold William and Mary's stated honor code as it is written, any infractions will be referred to the Honor Council.