MTH 231 - Discrete Mathematics I

Credits: 3

An introduction to logic, sets, relations, and counting for students in the mathematical and computing sciences. Topics include: Introduction to symbolic logic; types of proof including direct proof and proof by contradiction; introduction to mathematical induction; elementary set theory including sets, equivalence and partial order relations and functions; basic counting principles including permutations and combinations with and without multiplicity, the Binomial Theorem, an introduction to combinatorial proof and the Pigeonhole Principle; Introduction to recursive definition, solving first-order recurrences using iteration; solving linear homogeneous and non-homogeneous recurrences with constant coefficients

Pre-Requisites: MTH 111 with grade of 2.0 or better