University of Calgary

MATH 643 - Computational Number Theory - Fall 2018

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.
This course may not be repeated for credit.


  • H(3-0)


  • Admission to a graduate program in Mathematics and Statistics or consent of the Department.


  • Credit for Mathematics 643 and any of Mathematics 527, Pure Mathematics 527, or Pure Mathematics 627 will not be allowed.


Powered by UNITIS. More features.