Number theory is a vast and fascinating field of mathematics consisting of the study of properties of the integers. As Joe Silverman said in his book "A Friendly Introduction to Number Theory", "Number theory is partly experimental and partly theoretical. The experimental part normally comes first; it leads to questions and suggests ways to answer them. The theoretical part follows; in this part one tries to devise an argument that gives a conclusive answer to the questions." In this course, we will emphasize the experimental nature of number theory, doing a lot of experiments by using SAGE.
Prerequisites
MATH210 (Discrete Math I) and MATH245 (Introduction to Proofs), or by permission of the instructor. If you had MATH451 (Abstract Algebra), that will be great. But this is not compulsory.
Synopsis
Divisibility, gcd, the Euclidean algorithm (at an advanced level),
Congruences, primitive roots, the discrete log problem,
Quadratic residues and the quadratic reciprocity law,
The RSA public-key cryptosystem,
Primality tests (in particular, the AKS theorem),
Sum of squares, Pythagorean triples, and Pell's equation.
Reading List
A Friendly Introduction to Number Theory, 4th edition, Joseph H. Silverman
Elementary Number Theory: Primes, Congruences, and Secrets, William Stein
The High Arithmetic, An Introduction to Number Theory, H. Davenport