Here you can find an UNOFFICIAL list of what we have more or less covered in the lectures

and what will be coming up soon. I will try to update this once a week.

All sections refer to the new version (2nd edition) of the book which arrived at Cremona's last week.

First, I consider Chapters 1-9 more or less background material (although I will very briefly

discuss relations (pg 72) and section 8.4). (Note that there is much more background

material in this edition of the book than the earlier one).

.........................................................................................

We have now completed the lectures and what we covered in the course, was more or less,

the following sections.

(Elementary combinatorics) 10.1, 10.2, 10.4, 10.5, 11.1, 11.2, 11.3, 12.1., 12.3, 12.4.

Observe that Theorem 11.2 is equivalent to the problem discussed in class concerning

distributing n identical candies to k distinct children where there is no requirement

that everyone gets at least one candy. However, it take a moment's thought to see

that these are the same thing.

(Graph theory) 15.1, 15.3, 15.4, 15.5, 15.6,16.3 15.7,17.4,

(2 step linear recursion) 19.2. Here we applied this to computing the number of length

n binary sequences with no adjacent 1's.

(Modular arithmetic) 13.1-13.5 (not 13.4). Also did RSA encyrption (which is NOT in the book).

(Equivalence relations) 12.2.

(Euler's phi-function) 10.3 (but not Theorem 10.3).

(more on permutations) 10.6,12.6.

(group theory) 20.1-20.8 (although not absolutely all things there)

(groups of permutations and applications to counting) 21.1-21.4.

(error-correcting codes) 24.1-24.4.