Number theory
Divisibility, modular arithmetic, primes and the number theory behind RSA encryption.
7 planned
No page in this subject is open yet. The planned list below shows what is coming, in learning order.
Planned
In learning order. These are not pages yet.
- The Euclidean algorithm as cutting squaresIntro
- How primes thin out: the prime number theoremAdvanced undergrad
- Modular arithmetic as clock arithmeticIntro
- Bézout's identity and modular inversesIntro
- Fermat's little theoremIntro
- Why a linear congruential generator repeatsIntro
- How RSA encryption worksIntro
How it connects
Builds on Proof, logic and sets
Leads to Abstract algebra
Subjects marked “connection” are linked by a related idea, not by a prerequisite.