Exam 2 study outline

Exam 2 will cover material from 3.1, 3.2, 3.3 (light), Chapter 4 (only selections from 4.4-4.6), and 5.1

In particular:
Complexity of algorithms (Big O proof, analysis)
Elementary number theory, esp. mod and prime numbers
Public key encryption and all the associated algorithms
  Euclid's algorithm, inverses, a number to a power mod a
  number(including successive squaring).
Other applications of number theory (hashing, etc.)
Math induction (1 proof)