MA 6133 Elements of Number Theory

3 Credits

This course covers: Prime numbers, the fundamental theorem of arithmetic, linear Diophantine equations. Fermat’s Little Theorem, Wilson’s Theorem, Euler’s theorem. Linear congruences, Chinese Remainder Theorem, Euler phi function, Moebius inversion. Primitive roots and indices, quadratic congruences, Quadratic reciprocity law. Perfect numbers, sums of squares, Siegel’s theorem. The prime number theorem. Computational number theory, primality testing, Cryptography. Elliptic curves.

Prerequisite(s): MA 6003 or adviser’s approval.
Weekly Lecture Hours: 3 | Weekly Lab Hours: 0 | Weekly Recitation Hours: 0