 | Select the desired Level or Schedule Type to find available classes for the course. |
| MAT 321 - Number Theory and its Applications |
|
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.
3.000 Credit hours 3.000 Lecture hours Levels: Undergraduate Schedule Types: Lecture Mathematics & Statistics Department Restrictions: May not be assigned one of the following Student Attributes: Online Accelerated Programs Prerequisites: Undergraduate level MAT 275 Minimum Grade of D- or Undergraduate level CSC 133 Minimum Grade of D- |
| Return to Previous | New Search |
 |