Discrete
Math

Fall 2009
course
navigation

home

Discrete math is the study of mathematical objects on which there is no natural notion of continuity. Examples include the integers, networks, permutations and search trees. After an introduction to the tools needed to study the subject, the emphasis will be on you *doing* mathematics. Series of problems will lead gradually to proofs of major theorems in various areas of the discipline. This course is recommended for those intending to do advanced work in math or computer science.
http://cs.marlboro.edu/ courses/ fall2009/discrete/ home
last modified Sunday September 6 2009 8:21 am EDT