A Course in Discrete Math

Welcome to the course page for A Course in Discrete Math!

This is an offering in the discrete mathematics subject, part of the mathematics department. It strongly overlaps with the same course offered in computer science, although with some differences in emphasis.

This is a full course in discrete mathematics, which means that it includes

• Lectures
• A schedule of readings
• A schedule of exercises
• A schedule of exams
• Solutions to exercises and exams

The lecture component is hosted on YouTube. This course page will hold the schedule, exercises, exams, and course notes for reference.

Textbook

The course is based on the textbook Discrete Mathematics and Its Applications by Kenneth Rosen. I have specifically used the 9th edition to design my lectures and exercises.

However, neither the book nor its version are required for this course. I try to describe readings and exercises by their content, and therefore it should be possible to use almost any version of the textbook for the assigned readings.

Moreover, if any discrete mathematics textbook covers the same topics, then it may be possible to use any other textbook that you like. It may be possible not to use a textbook at all, although I don't recommend it.

Schedule

• Chapter 1: Logic
• Chapter 2: Sets
• Chapter 3: Algorithms
• Chapter 4: Number theory
• Chapter 5: Induction and Recursion

Playlist

The entire video playlist is here: A Course in Discrete Math.