Exam 2 study outline

Exam 2 will cover material from Chapter 4 and 5

In particular:
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 (2 proofs)
Recursion (recursive algorithms, specification of recursive structures)