In this program
- Divisibility and congruences
- Classical theorems and functions
- Diophantine equations and cryptography
Divisibility and congruences
Number theory · Theoretical / proof-based
Divisibility and GCD
Objectives
- Divisibility and GCD
- The Euclidean algorithm
- Bézout's identity
- Linear Diophantine equations
- Prime numbers; fundamental theorem of arithmetic
- Congruences and modular arithmetic
- Fermat's little theorem
- Euler's theorem
Study materials
- Study guideComing soon
- Exam StrategyComing soon
- Common MistakesComing soon
- WorksheetsComing soon
- Word problemsComing soon
- Mixed PracticeComing soon
- Multi-Unit ProblemsComing soon
- ReviewComing soon
- Practice testComing soon
- Answer keyComing soon
Interactive practice
Quizzes, typed answers, and flashcards for this unit — coming soon.
- Coming soon
Quiz
Multiple-choice questions with instant feedback
- Coming soon
Typed practice
Type answers and check them
- Coming soon
Flashcards
Vocabulary and key facts
- Coming soon
Mixed quiz
Harder mixed review for this standard