Discrete mathematics is a subject that--while off the beaten track--has vital applications in computer science, cryptography, engineering, and problem solving of all types. Discrete mathematics deals with quantities that can be broken into neat little pieces, like pixels on a computer screen, the letters or numbers in a password, or directions on how to drive from one place to another. Like a digital watch, discrete mathematics is that in which numbers proceed one at a time, resulting in fascinating mathematical results using relatively simple means, such as counting. This course delves into three of Discrete Mathematics most important fields: Combinatorics (the mathematics of counting), Number theory (the study of the whole numbers), and Graph theory (the relationship between objects in the most abstract sense). Professor Benjamin presents a generous selection of problems, proofs, and applications for the wide range of subjects and foci that are Discrete Mathematics.