MTH 231 Discrete Mathematics 1

This course covers formal logic, methods of proof, sequences, recursion, and mathematical induction. Also included are combinatorics, set and graph theory, and trees.

Credits

4

Prerequisite

MTH 112Z with a C- or better within the past two years or equivalent placement via the math placement process

Course Learning Outcomes

Upon successful completion of this course, the student will be able to:

1. Apply basic set operations

2. Negate compound and quantified statements and form contrapositives

3. Construct a direct proof from definitions of simple statements

4. Learn and apply the principle of mathematical induction

5. Demonstrate an understanding of the construction of indirect proofs by contradiction and contraposition

6. Construct complete explanations for solutions to counting problems

7. Use at least one algorithm for finding a shortest path or minimal spanning tree in a connected graph