This is a rough draft of a text on Discrete Mathematics intended for Computing students. Full set available here

• Part I: Counting and Relations
  1. Counting
  2. More Counting
  3. Properties of Binomial Coefficients
  4. Relations and Functions

• Part II: Logic and Proof
  5. Logic (summarized version here)
  6. Proofs

• Part III: Modular Arithmetic and Cryptography
  7. Primes and Factorization
  8. Modular Arithmetic
  9. Discrete Exponentiation and Cryptography

• Part IV: Induction and Recurrences
  10. Mathematical Induction
  11. Sequences and Recurrences
  12. Solving Recurrences

• Part V: Graphs
  13. Trees and Graphs
  14. Degrees, Euler Tours and Hamilton Cycles
  15. Colorings and Planar Graphs

• Part VI: Groups and Codes
  16. An Introduction to Groups
  17. An Introduction to Codes

  References