Integers. Mathematical induction. Equivalence relations. Commutative rings, including the integers mod n, complex numbers and polynomials. The Chinese remainder theorem. Fields and integral domains. Euclidean domains, principal ideal domains and unique factorization. Quotient rings and homomorphisms. Construction of finite fields. Applications such as public domain encryption, Latin squares and designs, polynomial error detecting codes, and/or addition and multiplication of large integers. Prerequisite: MATH 102, 125 or 127. Note: This course may not be taken for credit if credit has already been obtained in MATH 326.
| Section | Capacity | Class times | Login to view Instructor(s) and Location |
|---|---|---|---|
|
LECTURE A1
(47559) |
126 |
2024-09-03 - 2024-12-09 (MWF)
12:00 - 12:50
|
|