Prerequisites:MATH 132, MATH 107, or HONR 132 and MATH 206 The Euclidean algorithm, prime and composite integers, elementary Diophantine equations, Pythagorean triples, Euler’s phi-functions, congruencies, Euler-Fermat theorems, exponents and primitive roots, and quadratic residues.
