Number Theory and Cryptography

Catalog description

Three hours lecture per week Prerequisite(s): MATH 300 or MATH 301 Description: Topics include: Divisibility, prime numbers, unique factorization theorem, congruences, solutions of linear congruences, solutions of quadratic congruences, Fermat’s Little Theorem, Wilson’s Theorem, and Euler’s phi function, Cryptography.