Fall 2003–2004

Ma/CS 6a - Introduction to
Discrete Mathematics
MWF 1:00  //  159 Sloan
David Damanik

Feedback Form

Click here for homework.

Text: Discrete Mathematics, revised edition, Norman L. Biggs, Oxford University Press

This is the first term of a three quarter survey course on Discrete Mathematics. The first term emphasizes ideas from enumeration (generating functions, inclusion-exclusion, permutation groups) and graph theory (trees, network flows), but also touches on topics in elementary number theory, coding, and cryptography.

(The second term of CS/Ma 6 will cover more of graph theory, algorithms, and algebraic structures; the third term is devoted to logic.)

Grading:  Grades will be based on ten weekly homework assignments. No examinations. You may discuss homework problems with other students, but solutions should be written up individually in your own words.