Various assignments and special handouts may go here. They may look fuzzy at first (depending on which version of TeX I create the dvi files with from which the Acrobat files are made), but they print fine, and they look fine when shown enlarged. The first few are:
Derangements: from recurrence to summation formula
Inventions assigned 2/8/99 (small errors in the statements of problems F, G and H4)
Invention P, assigned 3/1/99 (Reproving the basic Inclusion-Exclusion formula using modern notation - summation over sets )
A Proof by Ideal Elements. A careful example of the ideal element method in graph theory. Starting from Hall's Theorem for complete matchings, we derive a necessary and sufficient condition for 2-to-1 matchings.
First, here is the 10-page guide I made on writing papers for Senior conference several years ago.
Second, here is the 21-page version I made for Math 9 in 1995.
Neither of these is quite up to date on how to use computers to produce mathematical symbolism, but for the most part you should find them helpful.
Last updated 4/1/99