1. What’s on the exam? Sequences and Induction: Ch. 4.1-4.4
Discrete Probability: Ch
Integers and Division: see lecture notes
Cryptography: Ch. 10.4
Functions and Pigeonhole: Ch
Relations: Chapters 10.1, 10.2

2. Tools you need Writing sequences and summations
changing dummy variables
separate out first and last values
useful summations
Clearly express induction (strong and weak)
Counting with permutations and combinations
Discrete probabilities (inclusion-exclusion)

3. Tools, continued Factoring into primes
Encrypting and decrypting with RSA (mod)
Categorizing functions and relations
interpreting directed graphs
Applying the pigeonhole principle

4. Terms to know Countably infinite One-to-one, onto
Reflexivity, Symmetry, Antisymmetry, Transitivity

5. What you’ll be given
RSA formulas:
C = Me mod n
M = Cd mod n
n= p*q