Computational Number Theory

3 credits · Undergraduate Programs

An investigation of major problems in computational number theory, with emphasis on practical techniques and their computational complexity. Topics include basic integer arithmetic algorithms, finite fields, primality proving, factoring methods, algorithms in algebraic number fields. Prerequisite(s): Mathematics 327 and 431. Antirequisite(s): Credit for Mathematics 527 and 643 will not be allowed.