Students are introduced to the foundation of modern mathematics including basic set theory;
counting; solutions to recurrence relations; logic and quantifiers; properties of integers;
mathematical induction; asymptotic notation; introduction of graphs and trees; finite state
machines and formal languages; Boolean algebra.
- Determine truth value of statements to analyze a logical argument.
- Develop various proof techniques in elementary number theory
- Analyze properties of sequences and recurrence relations; apply the method of mathematical
- Prove different properties of sets; identify and construct mathematical functions.
- Apply properties of relations to problems in modular arithmetic.
- Utilize various counting techniques and principles to solve problems.
- Prove elementary properties of graphs and utilize various algorithms in graph theory.
- Analyze the asymptotic behaviour of functions, the efficiency of algorithms, and use regular
expressions and finite state automata to define regular languages.
- The Logic of Compound and Quantified Statements
- Elementary Number Theory and Methods of Proof
- Mathematical Induction and Recurrence Relations
- Set Theory and Functions
- Counting Techniques
- Elementary Graph Theory and Algorithms
- Analysis of Algorithm Efficiency and Finite-State Automata
Required text and materials
The following textbook is required for this course:
- Epp, S. S. (2020). Discrete Mathematics with Applications (5th edition). Boston:
Brooks/Cole Cengage Learning.
Type: Textbook: ISBN-13: 978-1-337-69419-3
Please be aware that due to COVID-19 safety guidelines all in-person exams have been suspended. As such, all final exams are currently being delivered through ProctorU, which has an approximate fee of $35 involved. There will be more information in your course shell, on how to apply, if your course has a final exam.
To successfully complete this course, students must achieve a passing grade of 50% or higher on
the overall course, and 50% or higher on the final mandatory examination.
|Assignment 1: The Logic of Compound and Quantified Statements
|Assignment 2: Elementary Number Theory and Methods of Proof
|Assignment 3: Mathematical Induction and Recurrence Relations
|Assignment 4: Set Theory and Functions
|Assignment 5: Relations
|Assignment 6: Counting Techniques
|Assignment 7: Elementary Graph Theory and Algorithms
|Assignment 8: Analysis of Algorithm Efficiency and Finite-State Automata
|Quiz 1 (Online):
|Quiz 2 (Online):
|Final Exam (mandatory)
Open Learning Faculty Member
An Open Learning Faculty Member is available to assist students. Students will receive the necessary contact information at the start of your course.