COT 3100C · Fall 2026 · University of Central Florida

Honors Discrete Math

Lectures: Tuesday and Thursday, 9:00–10:15am, NSC 102
Office hours: Tuesday, 2:00–3:00pm, HEC 245E
Email: karthik.complexity+discrete@gmail.com
Links: Webcourses · Syllabus · Scribe schedule · Anonymous feedback

Discrete math is the core building block of computer science. Algorithms, networks, cryptography, databases, AI, and even social networks all have discrete math hiding underneath. In this class we'll learn to turn our intuition about why things work into rigorous logical statements. Along the way we'll learn how to count the number of pizza orders you can make with four toppings, and, perhaps most importantly, how to set the right lineup to win your fantasy football league.

Textbook: None. References are posted for each lecture in the schedule below.
Grading: Quiz 1 (1%), course evaluations (1%), homework (15%), scribe notes (10%), final project (15%), three exams (20% each).

Schedule

Tentative. Topics past the current week may move.

# Date Topic Notes References

1 Aug 25 Introduction Slides Stable matchings: [EIV], Chapter 1

2 Aug 27 Boolean algebra, Peano's axioms Boolean algebra, Peano axioms Wikipedia: Boolean algebra, Peano axioms

3 Sep 1 Logic and proofs Logic and proofs Stanford CS103, Guide to Proofs

4 Sep 3 Predicates and quantifiers Predicates and quantifiers Stanford CS103, Lecture 3 slides (up to the section on functions)

Homework 1 · Solutions due Wed Sep 16, 5pm

5 Sep 8 Sets and Beyond Sets
Scribe notes (Wil) Notes UH Math

6 Sep 10 Induction Induction
Scribe notes (Julian) Discrete Math: An Open Introduction, Induction

7 Sep 15 Strong induction Strong induction
Scribe notes (Alejandro) Discrete Math: An Open Introduction, Strong induction

8 Sep 17 Induction with loop invariants Loop invariants
Scribe notes (Adam) Loop invariants (UW); Binary search notes (CMU 15-122)

Homework 2 · Solutions due Sun Sep 27, 11:59pm

9 Sep 22 Functions Functions
Scribe notes (Luca) Whitman, Functions

10 Sep 24 Relations Relations
Scribe notes (Martin) Whitman, Relations

Homework 3 · Solutions due Sat Oct 3, 11:59pm

11 Sep 29 Analyzing recursion Recurrence relations
Scribe notes (Gaston) Discrete Math: An Open Introduction, Characteristic root technique; Erickson, Solving recurrences

12 Oct 1 GCD GCD and extended Euclid
Scribe notes (Alexander) Wikipedia: Euclidean algorithm, Extended Euclidean algorithm

13 Oct 6 Modular arithmetic and RSA Modular arithmetic and RSA
Scribe notes (Kathryn) Discrete Math: An Open Introduction, Introduction to number theory; Wikipedia: RSA cryptosystem

Exam 1 Thu Oct 8, in class

Homework 4 due Fri Oct 23, 11:59pm

15 Oct 13 Graphs Graphs and Eulerian circuits
Scribe notes (Mateusz) Discrete Math: An Open Introduction, Graph definitions, Euler trails and circuits

16 Oct 15 Trees Trees and their applications
Scribe notes (Cole) Discrete Math: An Open Introduction, Trees; Wikipedia: Minimum spanning tree, Huffman coding

17 Oct 20 Pigeonhole principle – Wikipedia: Pigeonhole principle; Brilliant, Pigeonhole principle (worked problems)

Homework 5 due Mon Oct 26, 11:59pm

18 Oct 22 Counting 1 – –

19 Oct 27 Counting 2 – –

Exam 2 Thu Oct 29, in class

Scribe notes will be linked next to each lecture as they are submitted. Sign-up: scribe schedule.

Anonymous feedback

If you'd like to send me a message anonymously about the course, send me a note through the form below. It doesn't ask for a name or email and doesn't require signing in, so I receive only the text and can't reply — if you need an answer, email me directly instead.

Send anonymous feedback