Divisibility and congruences
Number theory · Theoretical / proof-based
Divisibility, GCD, and the Euclidean algorithm
Objectives
- Divisibility, GCD, and the Euclidean algorithm
- Bézout's identity and linear Diophantine equations
- Prime numbers; fundamental theorem of arithmetic
- Congruences and modular arithmetic
- Fermat's little theorem and Euler's theorem
Study materials
- Practice testComing soon