Explore the building blocks of integers: divisibility, primes, and the Fundamental Theorem of Arithmetic
Number theory begins with the simplest question: how do integers relate to each other through division? The prime numbers are the atoms of arithmetic — every integer greater than 1 can be written uniquely as a product of primes.
This is the Fundamental Theorem of Arithmetic, and it underpins everything in number theory. In this section, you'll explore divisibility structures, watch prime factorization unfold step by step, and discover the mysterious patterns that primes create.
Every integer has a structured hierarchy of divisors. The Hasse diagram shows this hierarchy as a graph: divisors are nodes, and edges connect each divisor to its immediate multiples. Click any node to see its relationships.
12 = 2^2 × 3
Watch trial division break any number into its prime building blocks. The algorithm divides by the smallest prime factor at each step until only 1 remains. The result is always unique — that's the Fundamental Theorem of Arithmetic in action.
Press Set to begin.
The oldest algorithm in mathematics (circa 240 BC). Starting from 2, cross off all multiples of each prime. What remains are the primes. Watch the beautiful wave patterns emerge as composites are eliminated.
Discovered by Stanislaw Ulam while doodling in a lecture: write integers in a spiral and highlight the primes. Unexpectedly, primes cluster along diagonal lines. This mystery — why diagonals? — hints at deep patterns in prime distribution that motivate the rest of this module.
Each dot is an integer spiraling outward from the center. Amber dots are primes — notice the diagonal alignments.
You now understand the fundamental structures of number theory:
Next: We'll study the Euclidean algorithm — the oldest and most elegant method for computing greatest common divisors.