Detailed Course Information

Select the desired Level or Schedule Type to find available classes for the course.

MAT 320 - Number Theory
Number Theory Prerequisite: MAT 230 This course covers a range of ideas from number theory, starting with the division algorithm, modular arithmetic, and divisibility tests. Main topics include the extended Euclidean algorithm, the Fundamental Theorem of Arithmetic, the Chinese Remainder Theorem, Wilson's Theorem, Fermat's Little Theorem, the Euler phi-function. Further topics may include cryptography, the existence of primitive roots, the theory of indices, and the study of the group integers mod n. Students will be required to write formal proofs. 3.000 Credit hours 3.000 Lecture hours Levels: Undergraduate Schedule Types: Lecture Mathematical Sciences Department Prerequisites: MAT 230

MAT 320 - Number Theory

Number Theory
Prerequisite: MAT 230

This course covers a range of ideas from number theory, starting with the division algorithm, modular arithmetic, and divisibility tests. Main topics include the extended Euclidean algorithm, the Fundamental Theorem of Arithmetic, the Chinese Remainder Theorem, Wilson's Theorem, Fermat's Little Theorem, the Euler phi-function. Further topics may include cryptography, the existence of primitive roots, the theory of indices, and the study of the group integers mod n. Students will be required to write formal proofs.

3.000 Credit hours
3.000 Lecture hours

Levels: Undergraduate
Schedule Types: Lecture

Mathematical Sciences Department

Prerequisites:
MAT 230

Return to Previous	New Search

Return to Previous

New Search

Skip to top of page

Detailed Course Information		Current Aug 26, 2026