UPDATED March 7.

<br>

<br>

Here you can find an UNOFFICIAL list of what we have more or less 
covered
in the lectures  <br> and what will be 
coming up soon. I will try to update this once a week. 
<br> 


<br>

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

<br>

<br>

First, I consider Chapters 1-9 more or less 
background material (although I will very briefly <br> discuss relations
(pg 72) and section 8.4). (Note that there is much  more background <br>
material in this edition of the book than the earlier one).

<br>

<br>
.........................................................................................<br>
We have now completed the lectures and what we 
covered in the course, was more or less, <br>  the following sections.

<br>

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

<br>
Observe that Theorem 11.2 is equivalent to the problem discussed in class
concerning 
<br>
distributing n identical candies to k distinct children
where there is no requirement <br> that everyone gets at least one candy.
However, it take a moment's thought to see <br> that these are the same thing.

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

<br>
(2 step linear recursion) 19.2. Here we applied this to computing
the number of length <br> n binary sequences with no adjacent 1's.

<br>

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

(Equivalence relations) 12.2. 

<br>

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


<br>

(more on permutations) 10.6,12.6.

<br>

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

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

(error-correcting codes) 24.1-24.4.