MATH3080 - Number Theory - 2019/20

Course Name: 
Course Year: 


General Information


  • LI, Charles
    • Office: 218
    • Email:

Teaching Assistant

  • Ng Ming Ho
    • Office: LSB228
    • Email:

Time and Venue

  • Lecture: Tue 10:30-12:15, Y.C Liang Hall 103, Wed 2:30-3:15 LSB LT4
  • Tutorial: Wed 3:30-4: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, Euler-phi 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) Number-theoretic functions.
  • (if time allowed) continued fraction, elliptic curve


  • Burton, Elementary Number Theory, 7th edition, Mcgraw-Hill international edition


  • Niven, Zuckermen, Montgomery, An Introduction to the Theory of Numbers 5th Edition

Lecture Notes


Assessment Scheme

Tutorial Classwork, max 10pts. Classworks will be given during tutorial. Each classwork counts 1pt. There are about 12-13 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