MATH643
Download as PDF
Computational Number Theory
Mathematics and Statistics
SC - Faculty of Science
Subject
MATH - Mathematics
Description
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): Admission to a graduate program in Mathematics and Statistics or consent of the Department.
Antirequisite(s): Credit for Mathematics 643 and any of Mathematics 527, Pure Mathematics 527, or Pure Mathematics 627 will not be allowed.
Prerequisite(s): Admission to a graduate program in Mathematics and Statistics or consent of the Department.
Antirequisite(s): Credit for Mathematics 643 and any of Mathematics 527, Pure Mathematics 527, or Pure Mathematics 627 will not be allowed.
Course Attributes
Fee Rate Group(Domestic) - A, Fee Rate Group(International) -B, GFC Hours (3-0)
Courses may consist of a Lecture, Lab, Tutorial, and/or Seminar. Students will be required to register in each component that is required for the course as indicated in the schedule of classes. Practicums, internships or other experiential learning modalities are typically indicated as a Lab component.
Component
LEC
Units
3
Repeat for Credit
No
Subject code
MATH
Understanding Course Information
Please refer to Course Terminology and Description to better understand how to interpret course information such as GFC hours, prerequisites, course levels, etc.
Note that not all courses are offered every term or every year. Please refer to the Schedule of Classes or Schedule Builder to see active class offerings.