This is a standard introduction to discrete mathematics for computer science. It covers the tools needed to reason rigorously about algorithms and systems: proof techniques, logic, number theory, graphs, counting, probability, and recurrences. Each topic is paired with problem sets, and the book stresses clear, convincing argument as a core skill for engineers.

Key Topics

• Induction
• Logical formulas and propositional logic
• Number theory and modular arithmetic
• Graphs, relations, and partial orders
• Counting, probability, and recurrences

Authors: Eric Lehman, F. Thomson Leighton, and Albert R. Meyer