What you'll learn
39 lessons in Number Theory
DivisibilityGCD & Euclid's algorithmPrimes & unique factorizationModular arithmeticDiophantine equationsChinese Remainder TheoremEuler's totient & RSA previewQuadratic residues & reciprocityPrimitive roots & discrete logContinued fractionsMultiplicative functionsSieve of Eratosthenes & sieve methodsPrime Number TheoremRiemann zeta & prime distributionElliptic curves introProof of Fermat's little theoremProof of Euclid's lemma + FTA outlineWilson's theoremCryptographic protocols (DH, RSA, ECC)Perfect numbers & Mersenne primesLegendre's formula: prime powers in n!Number bases & scales of notationThe divisor functions τ and σMultiplicative order & the group (Z/n)*Lagrange's theorem on polynomial congruencesSums of two & four squaresPell's equationFermat pseudoprimes & Carmichael numbersLifting the exponent (LTE)Gaussian integers ℤ[i]Primality testingInteger factorization algorithmsDirichlet convolution & Möbius inversionBernoulli numbers & sums of powersFarey sequences & the Stern–Brocot treeBinary quadratic forms & class numberp-adic valuation & absolute valueThe p-adic numbers ℚ_pHensel's lemma