University of Calgary

PMAT 527 - Computational Number Theory - Fall 2014

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.

Hours

  • H(3-0)

Notes

  • Lectures may run concurrently with Pure Mathematics 627.

Prerequisite(s)

  • Pure Mathematics 427 or 429.

Antirequisite(s)

  • Credit for both Pure Mathematics 527 and 627 will not be allowed.
Syllabus

Sections

Powered by UNITIS. More features.

Get Course Information