Exam Review, due September 30

I feel that the most important theorems are that a^phi(n) = 1 mod n. Also, that sum of phi(d) for all d that divides n is equal to n.

For this exam, I would expect to see problems similar to those found on the homework. I would in particular expect a problem on the Chinese remainder theorem, quadratic residues, and some theorems to prove on GCD, euclidean algorithm, and the like.

I personally need to brush up on the Chinese remainder theorem, but other than that, just a general review of all the material should suffice.

I would really like to see another Chinese remainder theorem worked out.