Fundamental Theorem of Arithmetic

Q: Why is the Fundamental Theorem of Arithmetic important?

It guarantees that prime numbers are the true building blocks of all integers greater than 1. Without this uniqueness, operations like finding GCDs, simplifying fractions, and working with divisibility rules would not be reliable. It also underpins modern cryptography, which relies on the difficulty of factoring large numbers into their unique prime components.

Q: Does the Fundamental Theorem of Arithmetic apply to 1?

No. The number 1 is not considered prime, and it has no prime factors. Its prime factorization is the "empty product," which equals 1 by convention. The theorem applies to every integer greater than 1.

Q: What does 'unique up to the order of factors' mean?

It means that $2 \times 3 \times 5$ and $5 \times 3 \times 2$ count as the same factorization of 30, since multiplication is commutative. The uniqueness is about which primes appear and how many times each appears, not the sequence you write them in.

Fundamental Theorem of Arithmetic

The assertion that prime factorizations are unique. That is, if you have found a prime factorization for a positive integer then you have found the only such factorization. There is no different factorization lurking out there somewhere.

Text box stating: "All integers greater than 1 are either prime or can be written as a unique product of integer powers of primes.

See also

Prime number

Key Formula

n = p_1^{a_1} \times p_2^{a_2} \times \cdots \times p_k^{a_k}

Where:

$n$ = Any integer greater than 1
$p_1, p_2, \ldots, p_k$ = Distinct prime numbers, listed in increasing order (p_1 < p_2 < \cdots < p_k)
$a_1, a_2, \ldots, a_k$ = Positive integer exponents indicating how many times each prime appears

Worked Example

Problem: Find the unique prime factorization of 360.

Step 1: Divide 360 by the smallest prime, 2.

360 \div 2 = 180

Step 2: Continue dividing by 2 as many times as possible.

180 \div 2 = 90, \quad 90 \div 2 = 45

Step 3: 45 is not divisible by 2, so move to the next prime, 3.

45 \div 3 = 15, \quad 15 \div 3 = 5

Step 4: 5 is itself prime, so we stop.

5 \div 5 = 1

Step 5: Collect all the prime factors and write the factorization.

360 = 2^3 \times 3^2 \times 5^1

Answer: The unique prime factorization of 360 is

2^3 \times 3^2 \times 5

. By the Fundamental Theorem of Arithmetic, no other set of primes and exponents can produce 360.

Another Example

This example demonstrates the uniqueness aspect of the theorem: different factoring paths always converge to the identical set of primes and exponents.

Problem: Two students factor 180 using different methods. Student A starts dividing by 2, while Student B starts by splitting 180 = 9 × 20. Show that both arrive at the same prime factorization.

Step 1: Student A divides by small primes in order: 180 ÷ 2 = 90, 90 ÷ 2 = 45, 45 ÷ 3 = 15, 15 ÷ 3 = 5.

180 = 2^2 \times 3^2 \times 5

Step 2: Student B starts differently, splitting 180 into 9 × 20.

180 = 9 \times 20

Step 3: Factor each part: 9 = 3² and 20 = 4 × 5 = 2² × 5.

180 = 3^2 \times 2^2 \times 5

Step 4: Rearrange the primes in increasing order. Both students get the same result.

180 = 2^2 \times 3^2 \times 5

Answer: Both methods yield

180 = 2^2 \times 3^2 \times 5

. The theorem guarantees this — no matter how you break a number down, the final prime factorization is always the same.

Frequently Asked Questions

Why is the Fundamental Theorem of Arithmetic important?

It guarantees that prime numbers are the true building blocks of all integers greater than 1. Without this uniqueness, operations like finding GCDs, simplifying fractions, and working with divisibility rules would not be reliable. It also underpins modern cryptography, which relies on the difficulty of factoring large numbers into their unique prime components.

Does the Fundamental Theorem of Arithmetic apply to 1?

No. The number 1 is not considered prime, and it has no prime factors. Its prime factorization is the "empty product," which equals 1 by convention. The theorem applies to every integer greater than 1.

What does 'unique up to the order of factors' mean?

It means that

2 \times 3 \times 5

and

5 \times 3 \times 2

count as the same factorization of 30, since multiplication is commutative. The uniqueness is about which primes appear and how many times each appears, not the sequence you write them in.

Fundamental Theorem of Arithmetic vs. Fundamental Theorem of Algebra

	Fundamental Theorem of Arithmetic	Fundamental Theorem of Algebra
What it concerns	Factoring positive integers into primes	Factoring polynomials into linear factors over the complex numbers
Key claim	Every integer > 1 has a unique prime factorization	Every polynomial of degree n has exactly n complex roots (counted with multiplicity)
Branch of math	Number theory	Algebra / complex analysis
Typical course level	Introduced in middle school or early high school	Introduced in precalculus or college algebra

Why It Matters

You encounter this theorem whenever you find a GCD or LCM, simplify a fraction, or determine whether a number is a perfect square. In more advanced courses, it is the foundation for modular arithmetic and RSA encryption, which secures online transactions. Understanding that prime factorization is unique gives you confidence that techniques built on factoring — from simplifying radicals to solving Diophantine equations — always produce consistent results.

Common Mistakes

Mistake: Including 1 as a prime factor in the factorization.

Correction: The number 1 is not prime. Including it would destroy uniqueness, because you could insert as many 1s as you like (e.g., 12 = 1 × 2² × 3 = 1 × 1 × 2² × 3). Prime factorizations use only primes: 2, 3, 5, 7, 11, …

Mistake: Stopping the factorization before all composite factors are broken down into primes.

Correction: Every factor in the final product must be prime. For example, writing 36 = 4 × 9 is not a prime factorization because 4 and 9 are composite. You must continue: 36 = 2² × 3².

Related Terms

Prime Factorization — The process guaranteed to be unique by this theorem
Prime Number — The indivisible building blocks used in factorizations
Integers — The number set to which the theorem applies
Positive Number — The theorem concerns positive integers greater than 1
Greatest Common Factor (GCF) — Found by comparing prime factorizations of two numbers
Least Common Multiple (LCM) — Computed using prime factorizations of two numbers
Composite Number — A number that can be factored into smaller primes