MATH 152: Elementary Theory of Numbers
Euclid's algorithm, fundamental theorems on divisibility; prime numbers; congruence of numbers; theorems of Fermat, Euler, Wilson; congruences of first and higher degrees; quadratic residues; introduction to the theory of binary quadratic forms; quadratic reciprocity; partitions. Prerequisite:
Math 51 and proof-writing experiences (e.g.,
Math 56).
Terms: Win
| Units: 4
| UG Reqs: GER:DB-Math, WAY-FR
Instructors:
de Faveri, A. (PI)
;
Xu, M. (TA)
Filter Results: