MAT 321 - Number Theory and its Applications

Credit Hours: 3

Prerequisite: MAT 275 or CSC 133. Introduction to the theory of numbers motivated by applications. Primes and divisibility; the Euclidean algorithm; linear congruences and the Chinese Remainder Theorem; Fermat’s Little Theorem; continued fractions and Farey sequences. Applications to cryptology, computer arithmetic, random number generators and primality testing. Possible additional applications to computer science, physics, communication, music.

Click here for the Spring 2025 Class Schedule.