Skip to content

Further Reading

General textbooks

These cover the whole of this book, and more, at a similar or slightly higher level. Most have gone through several editions; any recent edition will do.

  • Kenneth H. Rosen, Discrete Mathematics and Its Applications, McGraw-Hill. A comprehensive standard text with a very large number of exercises, written for students of computing.
  • Susanna S. Epp, Discrete Mathematics with Applications, Cengage. Especially careful about logic and about learning to write proofs.
  • Eric Lehman, F. Thomson Leighton and Albert R. Meyer, Mathematics for Computer Science. Lecture notes from a first course for computing students, freely available online; strong on proofs, counting and probability.
  • László Lovász, József Pelikán and Katalin Vesztergombi, Discrete Mathematics: Elementary and Beyond, Springer. A short, elegant book for readers who enjoy the mathematics for its own sake.
  • Oscar Levin, Discrete Mathematics: An Open Introduction. An open textbook, free to read, with a friendly treatment of counting, graphs and proof.

Logic and proof

  • Daniel J. Velleman, How to Prove It: A Structured Approach, Cambridge University Press. A gentle and thorough guide to reading and writing proofs, built on logic and set theory.
  • George Pólya, How to Solve It, Princeton University Press. A classic short book on the strategies of mathematical problem solving.

Counting, recurrences and probability

  • Ronald L. Graham, Donald E. Knuth and Oren Patashnik, Concrete Mathematics: A Foundation for Computer Science, Addison-Wesley. Sums, recurrences, binomial coefficients and generating functions, in depth and with wit.
  • Herbert S. Wilf, generatingfunctionology, A K Peters (an edition is freely available online). The standard introduction to generating functions.
  • William Feller, An Introduction to Probability Theory and Its Applications, Volume 1, Wiley. The classic text on discrete probability.

Number theory and cryptography

  • Joseph H. Silverman, A Friendly Introduction to Number Theory, Pearson. Number theory from the beginning, including RSA.
  • G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, Oxford University Press. The classic advanced text.
  • R. L. Rivest, A. Shamir and L. Adleman, "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems", Communications of the ACM 21(2), 1978. The original paper on RSA, short and readable.

Graphs, trees and algorithms

  • Douglas B. West, Introduction to Graph Theory, Prentice Hall. A thorough first course in graph theory.
  • Robin J. Wilson, Introduction to Graph Theory, Pearson. A shorter and gentler introduction.
  • Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Introduction to Algorithms, MIT Press. The standard reference for graph algorithms (search, shortest paths, spanning trees), recurrences and the master theorem.

Boolean algebra and automata

  • M. Morris Mano and Michael D. Ciletti, Digital Design, Pearson. Boolean algebra, Karnaugh maps and the design of combinational and sequential circuits.
  • Michael Sipser, Introduction to the Theory of Computation, Cengage. Finite automata, regular languages, context-free grammars, Turing machines and undecidability, with clear proofs.
  • John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman, Introduction to Automata Theory, Languages, and Computation, Pearson. A fuller treatment of the same material.