Number theory

By the end you’ll be able to

• Apply divisibility, the division algorithm, gcd and lcm, and the Euclidean algorithm with Bézout’s identity
• Use prime factorisation to count and sum divisors and to compute Euler’s phi function
• Solve linear congruences and linear Diophantine equations and apply the Chinese remainder theorem
• Apply Fermat’s little theorem, Euler’s theorem and Wilson’s theorem to find remainders and last digits of large powers