*Professors:* Hua Wang and Dejun Yang

*Telephone:* (303) 384-3236 and (303) 273-3307

*Room: *BB 280F and BB 280G

*Email:* huawang@x.y, djyang@x.y where x = mines and y = edu

*Textbook:* Discrete Mathematics and Its Applications, 7th Edition. Kenneth H. Rosen

* Reference Book: * Mathematical Structures for Computer Science, 7th Edition. Judth L. Gersting.

* Additional Student Resources: * web resource of the textbook

This course covers elementary discrete mathematics. It emphasizes mathematical definitions and proofs as well as applicable methods.

This class covers the following topics:

- Logic: propositional logic, logical equivalence, predicate logic quantifier
- Proofs: direct proof, proof by contraposition, proof by contradiction, proof by induction
- Sets: representation, relation, operations
- Recursion: recursive definition, computing closed-form solutions
- Counting: principles, permutations and combinations, binomial theorem
- Probability: conditional probability, Baye's theorem, random variables and expectations
- Relations and Functions: properties, types
- Graphs: concepts, trees, graph algorithms

3 hours lecture; 3 semester hours.

MATH213, MATH223, or MATH224 are required