MATH 7291 - Number Theory for Tchrs

(3) Divisibility properties of the integers and modular arithmetic. Greatest common divisors, Euclidean algorithm, and linear Diophantine equations. Tests for Divisibility. Systems of linear congruences and Chinese remainder theorem. Prime numbers, distribution of prime numbers, and Mersenne primes. Fermatâ€™s little theorem, Eulerâ€™s Theorem and Wilsonâ€™s Theorem. Applications to RSA encryption. This course will not be counted as credit for a graduate program in Mathematics except the Masters of Science in Mathematics with concentration in the Teaching of Mathematics.