Introduces students to ideas and techniques from discrete mathematics that are widely used in science and engineering. Mathematical definitions and proofs are emphasized. Topics include formal logic notation, proof methods; set theory, relations; induction, well-ordering; algorithms, growth of functions and complexity; integer congruences; basic and advanced counting techniques, recurrences and elementary graph theory. Other selected topics may also be covered.

Requisites: Requires a prerequisite of APPM 1360 or MATH 2300 (all minimum grade C-).

Schedule
Syllabus