Unique Factorization: Statement of the Theorem
What you'll learn: You'll discover one of the most fundamental guarantees in number theory—that every integer breaks down into primes in exactly one way.
The Core Idea
You've learned how to identify prime numbers and have seen that many integers can be expressed as products of primes. But here's the remarkable guarantee that underlies all of number theory:
The Fundamental Theorem of Arithmetic states that every integer greater than 1 can be written as a product of prime numbers in a way that is unique (up to the order of the factors).
In other words:
- Existence: Every integer n > 1 either is prime or can be expressed as a product of primes
- Uniqueness: There is only one way to factor n into primes (ignoring different orderings)
Why This Matters
Think of integers as "molecular compounds" and primes as "atoms." Just as water is always H₂O (never H₃O or HO₂), the number 12 is always 2 × 2 × 3. You might write it as 2 × 3 × 2 or 3 × 2 × 2, but the collection of prime factors—two 2's and one 3—never changes.
For example:
- 30 = 2 × 3 × 5 (and that's the only way using primes)
- 100 = 2² × 5² (no other prime factorization exists)
- 17 = 17 (already prime, so it's its own factorization)
This uniqueness is not obvious! It's a deep property that requires proof using tools like the Euclidean Algorithm and properties of GCDs you've already learned.
Key Takeaway: The Fundamental Theorem of Arithmetic guarantees that every integer greater than 1 has a unique prime factorization—primes are truly the "building blocks" of all integers.