Fundamental Theorem of Arithmetic: Explained with Examples

The Fundamental Theorem of Arithmetic states that every integer greater than 1 can be written as a product of prime numbers in exactly one way, ignoring the order of the factors. For example, 12 = 2 times 2 times 3 and no other collection of primes multiplies to 12.

It matters because it makes primes the "atoms" of multiplication: every integer has a unique prime DNA. This uniqueness is what lets us compute greatest common divisors from factorisations, simplify fractions reliably, and build cryptographic systems on factoring.

Key Concepts

• Prime factorisation: writing n as a product of primes, e.g. 60 = 2 times 2 times 3 times 5.
• Canonical form: n written with distinct primes raised to exponents, like 2³ times 3² times 5.
• Existence: every n > 1 has at least one prime factorisation (keep splitting composites).
• Uniqueness: there is only one — this is the hard, valuable half of the theorem.
• Why 1 is not prime: allowing 1 as a prime would give 6 = 2 times 3 = 1 times 2 times 3 = 1 times 1 times 2 times 3, destroying uniqueness.

Formulas

• Unique factorisation: each n > 1 equals a product of prime powers in exactly one way, up to order.
• GCD from exponents: gcd(m, n) takes the minimum exponent of each prime; lcm takes the maximum.
• Divisor test: d divides n exactly when every prime exponent in d is ≤ the matching exponent in n.
• Number of positive divisors of n = (e1+1)(e2+1)…(ek+1) where the ei are the prime exponents.

Worked Example

Factor 360: 360 = 36 times 10 = (2² times 3²) times (2 times 5) = 2³ times 3² times 5. Check: 8 times 9 times 5 = 72 times 5 = 360. Now find gcd(360, 48): factor 48 = 16 times 3 = 2⁴ times 3. Take minimum exponents: 2³ times 3¹ = 8 times 3 = 24. Verify: 360 ÷ 24 = 15 and 48 ÷ 24 = 2, both integers, and no larger common divisor exists.

Common Misconceptions

• "Order of factors gives a different factorisation." 2 times 3 times 5 and 5 times 2 times 3 are the same factorisation — the theorem ignores order.
• "Factorisation into composites is unique too." It is not: 36 = 4 times 9 = 6 times 6. Uniqueness holds only for prime factors.
• "The theorem is obvious." Existence is easy, but uniqueness needs Euclid's lemma (if a prime divides a product, it divides one factor) — it fails in some other number systems.

Real-World Applications

• Simplifying fractions and finding LCMs for scheduling and gear ratios.
• RSA encryption: security rests on the fact that factorisation is unique but hard to compute for large numbers.
• Divisor counting in combinatorics and contest mathematics.

The Fundamental Theorem of Arithmetic guarantees every integer above 1 has exactly one prime factorisation. That uniqueness turns primes into reliable building blocks for GCDs, LCMs, divisor counts and the cryptography securing the web.