|
|
|
Nov 08, 2024
|
|
MATH 251 - Discrete Mathematics I
Credits: 3
Description
Topics include fundamental principles of logic and proof methods, elements of set theory, equivalence relations and partitions, counting techniques, mathematical induction, cardinality, power set, inclusion-exclusion principle, Cartesian product, pigeonhole principle, binomial theorem, probability and expectation.
Student Learning Outcomes
- Study fundamental principles of logic including truth tables; the use of quantifiers, implications, and biconditionals; and method of direct proof and reductio ad absurdum.
- Solve problems involving equivalence relations, partitions, and the elements of set theory.
- Apply the counting techniques of combinations and permutations.
- Apply the axiom of mathematical induction to the proofs of numerical and set theoretic results.
- Work with the basics of functions between sets and apply these ideas to the proofs of theorems on power sets.
- Solve problems involving probability, discrete random variables, and mathematical expectation.
- Apply and extend all concepts.
Prerequisite: MATH 127 or equivalent
Corequisite: MATH 181 or equivalent
Add to Portfolio (opens a new window)
|
|
|
