Prime and composite integers; Euclidean algorithm; modular arithmetic; Chinese remainder theorem; unique factorization; quadratic reciprocity; Riemann zeta function; representation of numbers as a sum of squares. Prerequisites: MATH 300; MATH 304 or MATH 323 Credits 3. 3 Lecture Hours.
Prime and composite integers; Euclidean algorithm; modular arithmetic; Chinese remainder theorem; unique factorization; quadratic reciprocity; Riemann zeta function; representation of numbers as a sum of squares. Prerequisites: MATH 300; MATH 304 or MATH 323 Credits 3. 3 Lecture Hours.
