University of Calgary

PMAT 627 - Topics Computational Number Thry - Winter 2008

Examines some difficult problems in number theory and discusses 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.

Hours

  • H(3-0)

Prerequisite(s)

  • Pure Mathematics 427 or consent of the Division

Sections

This course will be offered next in Fall 2010.
Powered by UNITIS. More features.

Get Course Information