MATH3080  Number Theory  2019/20
Announcement
 Midterm info and review [Download file]
 Midterm Sample questions [Download file]
 Midtem solution (for reference only) [Download file]
 CW10 (solution will be posted on Dec 5) [Download file]
 CW11 (solution will be posted on Dec 5) [Download file]
 CW12 (solution will be posted on Dec 12) [Download file]
 CW13 (solution will be posted on Dec 12 [Download file]
 New assessment schemet [Download file]
 New New assessment exam review [Download file]
 New Sample exam questions (no solutions) [Download file]
 New Sample exam questions (with solutions) [Download file]
General Information
Lecturer

LI, Charles
 Office: 218
 Email:
Teaching Assistant

Ng Ming Ho
 Office: LSB228
 Email:
Time and Venue
 Lecture: Tue 10:3012:15, Y.C Liang Hall 103, Wed 2:303:15 LSB LT4
 Tutorial: Wed 3:304:15 LSB LT4
Course Description
 Divisibility of integers, the division algorithm, gcd, the Euclidean algorithm
 The fundamental theorem of arithmetic, primes, factorization.
 modular arithmetic, Fermat's little theorem, Euler's theorem, Eulerphi function, Wilson's theorem, Fermat's theorem of sum of squares.
 Fast modular exponentiation algorithm, primality test, pseudoprimes.
 Basic cryptography, cryptocurrency
 Primitive roots and indexes
 The quadratic reciprocity law
 Quadratic forms
 (if time allowed) Numbertheoretic functions.
 (if time allowed) continued fraction, elliptic curve
Textbooks
 Burton, Elementary Number Theory, 7th edition, McgrawHill international edition
References
 Niven, Zuckermen, Montgomery, An Introduction to the Theory of Numbers 5th Edition
Lecture Notes
 Lecture 0: Class Info
 Lecture 1 : Introduction
 Lecture 2 : Divisibility
 Lecture 3 : LCM and linear diophantine equations
 Lecture 4: The Fundamental theorem of Arithmetic
 Lecture 5: Infinitude of primes
 Lecture 6: Modular Arithmetic
 Lecture 7: Modular Arithmetic II
 Lecture 8: Fast modular exponentiation and primality Test
 Lecture 9: Cryptography
 Lecture 10: Polynomials
 Lecture 11: Primitive roots
 Lecture 12: Primitive roots II
 Lecture 13: The quadratic reciprocity Law
 Lecture 14: Binary quadratic forms
Assignments
 CW1 with solution (last updated: Sep 15)
 CW2 with solution (last updated: Sep 22)
 CW3 with solution (last updated: Oct 14)
 CW4 with solution (last updated: Oct 14)
 CW5 with solution (last updated: Oct 14)
 CW6 with solution (last updated: Oct 18)
 CW7 with solution (last updated: Oct 27)
 CW8 with solution (last updated: Nov 3)
 CW9 with solution (last updated: Nov 8)
 CW10 with solution (last updated: Dec 7)
 CW11 with solution (last updated: Dec 7)
 CW12 with solution (last updated: Dec 12)
 CW13 with solution (last updated: Nov 12)
Assessment Scheme
Tutorial Classwork, max 10pts. Classworks will be given during tutorial. Each classwork counts 1pt. There are about 1213 tutorals and you need to attend at least 10 of the tutorials.  10%  
Mid Oct 22 Tue During Lecture  30%  
Final  60%  
Please check the new assessment scheme  % 
Assessment Policy Last updated: December 07, 2019 13:06:55