MATH 3370

Examines perfect numbers and primes, divisibility, Euclidean algorithm, greatest common divisors, primes and the unique factorization theorem, congruences, cryptography (secrecy systems), Euler-Fermat theorems, power residues, primitive roots, arithmetic functions, Diophantine equations, topics above in the setting of the Gaussian integers.