This course will examine some difficult problems in number theory and discuss a few of the computational techniques that have been developed for solving them. Such problems include: modular exponentiation, primality testing, integer factoring, solution of polynomial congruences, quadratic partitions or primes, invariant computation in certain algebraic number fields, etc. Emphasis will be placed on practical techniques and their computational complexity.
This course may not be repeated for credit.

Sections

This course will be offered next in Winter 2008.