MA 333 Number Theory
Topics include: divisibility, prime numbers, Euclid’s algorithm, linear congruences, quadratic residues, numerical functions, factorization, Diophantine equations, applications, and puzzles. Potential applications include hash functions, random number generation, and encryption. Prerequisite: "C" or better in MA 343.
Lab Hours
0
Lecture Hours
3
Prerequisite
C or better in
MA 343 Introduction to Proofs.