In this exciting college-level math course, students will explore the fascinating world of discrete math. From logic and complexity to combinatorics and recurrence equations, this course will cover all the fundamentals of discrete, countable elements. Students will also learn about mathematical induction, equivalence relations and partial orders, and Euclid's Algorithm, among other exciting topics. By the end of this course, students will have a comprehensive understanding of discrete math and how it is used in real-world applications.