# Readings

This section contains the complete course notes, Mathematics for Computer Science.

NB allows you to annotate PDFs for yourself or for sharing with others. We are piloting NB on this course and will use the results of this pilot to decide whether this tool will be useful for other courses.

CHAPTERS FILES NB PDFs
Complete course notes
Chapter 1: What is a proof? (PDF) (NB PDF)
Chapter 2: The well ordering principle (PDF) (NB PDF)
Chapter 3: Propositional formulas (PDF) (NB PDF)
Chapter 4: Mathematical data types (PDF) (NB PDF)
Chapter 5: First-order logic (PDF) (NB PDF)
Chapter 6: Induction (PDF) (NB PDF)
Chapter 7: Partial orders (PDF) (NB PDF)
Chapter 8: Directed graphs (PDF) (NB PDF)
Chapter 9: State machines (PDF) (NB PDF)
Chapter 10: Simple graphs (PDF) (NB PDF)
Chapter 11: Recursive data types (PDF) (NB PDF)
Chapter 12: Planar graphs (PDF) (NB PDF)
Chapter 13: Communication networks (PDF) (NB PDF)
Chapter 14: Number theory (PDF) (NB PDF)
Chapter 15: Sums and asymptotics (PDF) (NB PDF)
Chapter 16: Counting (PDF) (NB PDF)
Chapter 17: Generating functions (PDF) (NB PDF)
Chapter 18: Introduction to probability (PDF) (NB PDF)
Chapter 19: Random processes (PDF) (NB PDF)
Chapter 20: Random variables (PDF) (NB PDF)
Chapter 21: Deviation from the mean (PDF) (NB PDF)