Number Theory

0.5 credits · Undergraduate

Divisibility (GCDs, LCMs, Euclidean algorithm, Bezout's identity). Linear Diophantine Equations. Prime numbers (Factorization; Fermat/Mersenne numbers; pseudoprimes; Carmichael numbers). Modular Arithmetic (Chinese Remainder Theorem; Fermat/ Euler theorem). Group of units mod m. Primitive roots. Quadratic Residues (Legendre symbols; Quadratic Reciprocity). Prerequisite: MATH 1350H and 2200H.