- Campus Life
- Financial Aid
This course information is derived from the Online Course Catalog, which is under development. The information may not be accurate and is provided only as a convenience. Please consult the print or PDF version of the Course Catalog for all official course information.
4 sem. hrs. Prereq.: MATH 210 and MATH 211. Reviews set theory; groups and group homomorphism; rings and ring homomorphisms and examples; Euclidean division algorithm; prime factorization and Chinese remainder theorem with applications to cryptography; Peano's postulates, leading to a description of the integer, rational, real, and complex number systems; Fermat's Little Theorem; Euler phi function; and linear and quadratic residues. Staff.