620-351 Number Theory

One of [00]620-111, 620-120 (MUPHAS Mathematics), 620-121, 620-141.

This subject introduces the elementary concepts of divisibility; the basic theory and use of congruences; the properties of powers of elements in congruences, particularly Euler's theorem; the law of quadratic reciprocity; and basic properties of continued fractions and some applications. It develops applications of all of the above to primality testing, factorisation algorithms and cryptanalysis. Students should develop the ability to perform the algorithms inherent in the subject material; and to understand and present proofs related to the subject material. This subject demonstrates the extent and uses of elementary number theory, its applicability in other parts of mathematics, and its potential for application outside of mathematics.

Topics include factorisation, primes, greatest common divisors; congruences; primitive roots; quadratic reciprocity; continued fractions, Pell's equation; compositeness testing and factorisation; and applications to cryptanalysis.

Up to 24 pages of written assignments and a 3-hour end-of-semester written examination.