Math 231: Elements of Discrete Mathematics I
Specifically, students who complete Math 231: Elements of Discrete Mathematics I will be able to:
• model and solve applied, real–world, and theoretical mathematical problems requiring operations using sets both symbolically using DeMorgan’s Laws, propositional calculus of quantified statements, and Boolean Algebra and graphically using truth tables and Venn diagrams.
• determine and analyze the logical form of valid and invalid arguments using various methods of proof including truth tables, Venn diagrams, and the propositional calculus of quantified statements.
• apply the principles of the logical form of arguments to the design of digital logic circuits.
• understand and analyze methods of proof including mathematical induction and proof by contradiction.
• solve problems involving a variety of number systems including binary and hexadecimal and their application to the design of digital logic circuits.
• analyze and solve problems that require the use of recursion relations and iteration.