Euler Phi

 MTH 521
Theory of Numbers
Fall 2018		 Inverse Euler Phi
Merton's Function

MTH 521 Theory of Numbers 3(3-0)

Properties of integers, congruences, greatest common divisors and prime factorization, applications of number theory to computer science and/or cryptology. Prerequisite: MTH 332.

Syllabus Homework

Syllabus  (pdf format)
Gaussian Primes

Back