There will be 5 fortnightly exercise sheets of around 10 exercises, of which a few will be assessed. Solutions to Section B are for handing in. Section A is easier and is meant as a warming up. Questions in section C are similar to those in section B but not for handing in. Section D is harder and optional. Please put your solutions into the MA241 Combinatorics box in front of the General Office. The deadlines of Mondays 2pm of weeks 4,5,7,9,16 are strictly maintained. (Week 16 is the second week of term 2).
There are support classes given by Mark Cummings on Thursday and by Michael Dor� on Friday (weeks 2-10):
B213/214 (science concourse)
Science concourse is the building in front of the main library, that's the same building and level as L3 where we lecture on Wednesday.
Our lecture notes (1 September 2006)
( postscript -
pdf ) written by a student, based on a course by Derek Holt, revised by David Mond and me. The lecture notes are available at the General Office for 150 pence.
I will be happy to help with queries of any sort. Just send an email to me firstname.lastname@example.org or drop by in my office MI-B1.17 .
Besides the printed notes no book is used. The lecture notes and course are based on a nice but expensive book called Concrete Mathematics, second edition, by Graham, Knuth, Patashnik, Addison-Wesley. It contains more material and exercises. Other recommendable books:
Counting and Configurations, Herman, Kucera, Simsa, Springer 2003, 392 pages, $70. Theory and lots of exercises with solutions, mainly on counting of geometric situations.
102 Combinatorial Problems, Andreescu, Feng, Birkh�user, 2003, 115 pages, $25. Lots of exercises with solutions. Less of calculations, more of combinatorial reasoning.
Proof that really count, Benjamin and Quinn, Math. Ass. America, 2003, 194 pages, $42. Similar to our course but no generating functions.
Combinatorial enumeration, Goulden and Jackson, Dover, 2004. A classic recently reprinted for $35. Emphasis on generating functions. 350 exercises and full solutions. Goes further than us.
Enumerative Combinatorics, volumes 1, 2. Stanley, Cambridge, 1997 and 1999, 325+581 pages. Top class. Goes far beyond our scope.
Here is our mock exam:
pdf . It is of the same difficulty and question style as the real exam. Solutions will not be made available.
How to prepare for your exam (29 November 2006):
pdf. From the contents: exact syllabus; what to memorize.
The final mark composes from a two-hour exam in term 3 (90%) and the 4 best of your 5 assignments (10%).