At the end of the course, students are expected to learn
- basic examples of number-theoretic algorithms
- fast computations modulo n
- integer and polynomial factorization
- various primality tests
- efficient implementation of various mathematical objects on a computer