Primes, divisibility, congruences, Chinese remainder theorem, primitive roots, quadratic residues, quadratic reciprocity, and Jacobi symbols. The Euclidean algorithm and strategies of computer programming. Course Information: 3 undergraduate hours. 4 graduate hours. Prerequisite(s): Grade of C or better in MATH 215.