University of Calgary
MATH 527 - 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.Syllabus
This course may not be repeated for credit.
Hours
- H(3-0)
Prerequisite(s)
- Mathematics 431 or Pure Mathematics 431; Mathematics 429 or Pure Mathematics 429 or Mathematics 327 or Pure Mathematics 427.
Antirequisite(s)
- Credit for more than one of Mathematics 527, Pure Mathematics 527 and 643 will not be allowed. Also known as: (formerly Pure Mathematics 527)
Sections
LEC 1 MWF 09:00 - 09:50 Dang Khoa Nguyen Outline
Powered by UNITIS. More features.