MAS330 Topics in Number Theory
Note: This is an old module occurrence.
You may wish to visit the module list for information on current teaching.
|Semester 1, 2017/18||10 Credits|
|Lecturer:||Dr Evgeny Shinder||Home page (also MOLE)||Reading List|
|Aims||Outcomes||Teaching Methods||Assessment||Full Syllabus|
The course covers topics in elementary Number Theory. This includes Modular Arithmetic, and properties of primes and integers. Most of the material (with the notable exception of the RSA cryptosystem) has been introduced by Fermat, Euler and Gauss in the 17th, 18th and 19th centuries.
Prerequisites: MAS211 (Advanced Calculus and Linear Algebra)
The following modules have this module as a prerequisite:
|MAS345||Codes and Cryptography|
1. Modular Arithmetic
- Linear Congruences
- Fermat's Little Theorem and the RSA cryptosystem.
- Arithmetic functions.
- Euler's function and Euler's theorem.
- Gauss' Quadratic Reciprocity Law.
2. Primes, Integers and Equations
- Perfect numbers, Mersenne primes, Fermat primes.
- Pythagorean triples and Fermat Last Theorem.
- Generating functions and partitions.
- Continued fractions.
- Pell's equation.
- To introduce various topics in number theory
Learning outcomesSee Full Syllabus.
Lectures, problem sheets. It is highly recommended to work on the problems and submit the assigned problems which will be marked for feedback.
20 lectures, no tutorials
Assessment: one formal 2 hour and 30 minutes written examination (4 questions out of 4). On the exam you will be solving problems using methods we learnt in class. You will also need to be able to give definitions and state theorems of the course, and to apply these theorems creatively.Note: calculators are not allowed on the exam.
Week 1: Linear Congruences
Fundamental theorem of arithmetic; Euclidean algorithm; review of modular arithmetic; solving linear congruences with Euclidean algorithm; Chinese remainder theorem.
Fermat's Little Theorem, the RSA algorithm. Week 3: Arithmetic functions.
The functions τ and σ; multiplicativity of τ and σ; the Möbius inversion formula. Week 4: Euler's function and Euler's theorem.
Euler's ϕ-function; multiplictivity of ϕ; Euler's theorem; quadratic residues and non-residues; Euler's criterion;. Week 5: Gauss' Quadratic Reciprocity Law.
Quadratic congruences; the Legendre symbol; quadratic reciprocity. Week 6: Perfect numbers, Mersenne primes, Fermat primes.
Formula for even perfect numbers; Mersenne primes, Fermat primes. Week 7: Reading week
Week 8: Pythagorean triples and Fermat Last Theorem.
Finding all solutions of x2 + y2 = z2; statement of the Fermat Last Theorem; equation m = x2 + y2. Week 9: Generating series and partitions.
Generating series. Partitions. Week 10: Continued fractions.
Representing rational numbers as a finite continued fraction; the convergents; numbers pk, qk; ratio of two consequtive Fibonacci numbers; representing irrational numbers as infinite continued fractions; periodic continued fractions. Week 11: Pell's equation.
Solving Pell's equation using continued fractions; the fundamental solution; all solutions may be obtained from the fundamental solution. Week 12: Reading week
|B||Burton||Elementary number theory||512.81 (B)||Blackwells||Amazon|
|B||Rose||A course in number theory|
(A = essential, B = recommended, C = background.)
Most books on reading lists should also be available from the Blackwells shop at Jessop West.