MATH 240: Introduction to Discrete Mathematics

Spring 2025 · UW–Madison

Discrete mathematics develops precise ways to reason about finite and countable structures. These notes connect mathematical proof with the sets, functions, algorithms, and graphs used in computer science.

Topics

• Logic, quantifiers, and proof methods
• Sets, functions, and relations
• Induction, recursion, and algorithm correctness
• Asymptotic analysis and recurrences
• Counting, graphs, and trees

Notes

• Lectures
• Weekly overview
• Homework
• Discussion worksheets
• Exams and review
• Concept references
• Textbook chapters
• Course details

Resources

Course instructional materials: Mitchel T. Keller and the UW–Madison MATH/COMP SCI 240 teaching staff. Textbook: Introduction to Discrete Mathematics, Sandy Irani et al., © zyBooks. Original handouts, textbook extracts, student work, and course details are private study material.