Prime Numbers Explained: Definition, Factorization, Cryptography, and the Riemann Hypothesis

Prime numbers are the multiplicative building blocks of the integers. In this Woody Calculus lesson, learn the formal definition of a prime, why 1 is excluded, the Fundamental Theorem of Arithmetic, Euclid’s proof of infinitely many primes, the Sieve of Eratosthenes, prime patterns modulo 6, the Prime Number Theorem, modern cryptography, and the deep connection between primes and the Riemann Hypothesis.

Continue Reading →

Finite Field Theory Explained: Tiny Algebra, Massive Consequences

Finite field theory looks abstract until you realize it powers modern cryptography, error correction, QR codes, AES encryption, and elliptic curve cryptography. In this Woody Calculus visual lesson, learn what finite fields are, why prime fields matter, why every finite field has size q = p^n, how extension fields are built from irreducible polynomials, and why finite fields are the hidden algebra behind secure communication.

Continue Reading →