MAT 146(3-0-3)
Discrete Mathematics
This course is an introductory level course in discrete mathematics. Topics include sets, relations, equivalence relations, functions, sequences, mathematical induction, mathematical structure, techniques of proof, truth tables, logic, syllogisms, The Binomial Theorem, permutations and combinations, and The Pigeonhole Principle. Also included are graphs and networks, Euler trails and curcuits, Hamiltonian paths and cycles, trees, and minimal spanning trees.
PR: MAT 129 or equivalent