3.00 Credits
A selection of topics from set theory, combinatorics, graph theory, algebra, Boolean algebra, formal logic, and computer science that are both useful and basic to students in applied mathematics, computer science, and engineering. Formal mathematical proofs via induction, combinatorial arguments, truth tables and propositions, Russell's Paradox, principle of inclusion and exclusion, the pigeonhole principle and analysis of algorithms, countably and uncountably infinite sets, generating functions, recurrence relations, and lattices