MTH 232 Discrete Mathematics 2

This course covers functions, relations, Pigeonhole principle, isomorphisms, Boolean algebras, and recursion.

MTH 231 with a C- or better within the past two years

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

1. Apply notation and technique to functions, inverse functions, and composition of functions

2. Use recursive reasoning in logical arguments

3. Use set theory in logical arguments and Boolean algebra

4. Determine if a given mathematical structure is a Boolean algebra

5. Prove elementary properties of Boolean algebras

6. Know the properties of relations on finite and infinite sets

7. Understand equivalence relations and equivalence classes

8. Use modular arithmetic

9. Differentiate between partial and total order relations