MATH 2305 - DISCRETE MATHEMATICS

A course designed to prepare math, computer science, and engineering majors for a background in abstraction, notation, and critical thinking for the mathematics most directly related to computer science. Topics include: logic, relations, functions, basic set theory, countability and counting arguments, proof techniques, mathematical induction, combinatorics, discrete probability, recursion, sequence and recurrence, elementary number theory, graph theory, and mathematical proof techniques. 

Upon successful completion, students will be able to:

• Construct mathematical arguments using logical connectives and quantifiers. 

• Verify the correctness of an argument using propositional and predicate logic and truth tables. 

• Demonstrate the ability to solve problems using counting techniques and combinatorics in the context of discrete probability. 

• Solve problems involving recurrence relations and generating functions. 

• Use graphs and trees as tools to visualize and simplify situations. 

• Perform operations on discrete structures such as sets, functions, relations, and sequences. 

• Construct proofs using direct proof, proof by contraposition, proof by contradiction, proof by cases, and mathematical induction. 

• Apply algorithms and use definitions to solve problems to prove statements in elementary number theory.

Grade Basis: L 

Credit hours: 3.0

Lecture hours: 48.0

Prerequisites: 

MATH 2413 - CALCULUS I