Theoretical / proof-based
Number theory · Undergraduate · Math
Learning objectives from the Number theory syllabus, grouped by unit. Click an objective for study materials.
Topics typically covered
Click a topic for the full text and related unit practice.
Undergraduate Number Theory — scope drawn from open number theory texts (e.g. Stein / Burton-style OER) and typical US elementary number theory syllabi.
Divisibility and congruences
- Divisibility and GCD — Divisibility and GCD
- The Euclidean algorithm — The Euclidean algorithm
- Bézout's identity — Bézout's identity
- Linear Diophantine equations — Linear Diophantine equations
- Prime numbers — Prime numbers; fundamental theorem of arithmetic
- Congruences and modular arithmetic — Congruences and modular arithmetic
- Fermat's little theorem — Fermat's little theorem
- Euler's theorem — Euler's theorem
Classical theorems and functions
- Wilson's theorem — Wilson's theorem
- Order of elements modulo n — Order of elements modulo n
- Chinese remainder theorem — Chinese remainder theorem
- Applications — Applications
- Euler's totient function — Euler's totient function
- Multiplicative functions — Multiplicative functions
- Quadratic residues and Legendre symbol — Quadratic residues and Legendre symbol
- Law of quadratic reciprocity (introduction or proof sketch) — Law of quadratic reciprocity (introduction or proof sketch)
Diophantine equations and cryptography
- Pythagorean triples — Pythagorean triples
- Primitive solutions — Primitive solutions
- Sums of two squares (introduction) — Sums of two squares (introduction)
- Continued fractions (optional topic) — Continued fractions (optional topic)
- RSA and public-key cryptography from number-theoretic primitives — RSA and public-key cryptography from number-theoretic primitives
- Introduction to algebraic number theory: Gaussian integers (optional) — Introduction to algebraic number theory: Gaussian integers (optional)
Learning objectives
Click an objective for study materials.
Divisibility and congruences
- Divisibility and GCD — Divisibility and GCD
- The Euclidean algorithm — The Euclidean algorithm
- Bézout's identity — Bézout's identity
- Linear Diophantine equations — Linear Diophantine equations
- Prime numbers — Prime numbers; fundamental theorem of arithmetic
- Congruences and modular arithmetic — Congruences and modular arithmetic
- Fermat's little theorem — Fermat's little theorem
- Euler's theorem — Euler's theorem
Classical theorems and functions
- Wilson's theorem — Wilson's theorem
- Order of elements modulo n — Order of elements modulo n
- Chinese remainder theorem — Chinese remainder theorem
- Applications — Applications
- Euler's totient function — Euler's totient function
- Multiplicative functions — Multiplicative functions
- Quadratic residues and Legendre symbol — Quadratic residues and Legendre symbol
- Law of quadratic reciprocity (introduction or proof sketch) — Law of quadratic reciprocity (introduction or proof sketch)
Diophantine equations and cryptography
- Pythagorean triples — Pythagorean triples
- Primitive solutions — Primitive solutions
- Sums of two squares (introduction) — Sums of two squares (introduction)
- Continued fractions (optional topic) — Continued fractions (optional topic)
- RSA and public-key cryptography from number-theoretic primitives — RSA and public-key cryptography from number-theoretic primitives
- Introduction to algebraic number theory: Gaussian integers (optional) — Introduction to algebraic number theory: Gaussian integers (optional)
Multi-Unit Problems
Course-level sets that combine skills across study units (coming soon).
Browse Multi-Unit ProblemsWhat each unit includes
Open a unit below for full materials. Typical resources:
- Study guide
- Exam Strategy
- Common Mistakes
- Worksheets
- Word problems
- Mixed Practice
- Multi-Unit Problems
- Review
- Practice test
- Answer key
Study units
Each unit includes a study guide, worksheets, review, practice test, and answer key. One unit is free; subscribe for the full class.
- Divisibility and congruences
Divisibility and GCD
Coming soon - Classical theorems and functions
Wilson's theorem
Coming soon - Diophantine equations and cryptography
Pythagorean triples
Coming soon
Pricing calculator
Choose materials, tutoring, or both — or book a single session as needed. Customize your plan on the subscribe page.
$1,162 · Number theory · 18 tutoring hrs
Study guides, worksheets, reviews, practice tests, and answer keys for 1 class. 18 tutoring hours (1 hr / week · semester). Bundle discount applied vs buying separately. Pay in full via Zelle.