# MATH 176

From CS Wiki

### Discrete Mathematics

**Catalog Description:** Induction, set theory, graph theory, number systems, Boolean algebra, and elementary counting.

**Total Credits:** 3

**Contact Hours:** 3 lecture hours per week

**Course Coordinator**: Hirotachi Abo

**URL:** http://www.webpages.uidaho.edu/~abo/

**Prereq:** MATH 143: Pre-Calculus Algebra or equivalent placement scores

**Textbook:** "Discrete and Combinatorial Mathematics" by Ralph P. Grimaldi, Pearson Education

**Textbook URL:** http://www.pearsonhighered.com/educator/academic/product/1,4096,0201199122,00.html?type=FEA

**Prerequisites by Topic**:

## Main Topics Covered

- Fundamental Principles of Counting
- Fundementals of Logic
- Set Theory
- Properties of Integers
- Relations and Functions

## Course Outcomes

- Understand and use combinatorial techniques for counting problems.
- Read and write statements involving standard mathematical notation, which include quantifiers, set operations, and "if-then" structures.
- Identify the converse, contrapositive, and negation of a given logical statement.
- Understand and use the notion of set to formulate the mathematical topic being investigated in a concise manner.
- Learn mathematical induction and will be able to write simple proofs using mathematical induction.
- Have an understanding of functions from a set-theoretic approach.
- Learn discrete methods relevant to Computer Science.