Fundamental Theorem of Arithmetic

Introduction: Why every whole number has a unique prime “DNA” ✨

students, every positive whole number bigger than $1$ can be built from prime numbers in one and only one way, except for the order of the primes. This idea is called the Fundamental Theorem of Arithmetic. It is one of the most important results in number theory because it explains why prime numbers are the basic building blocks of all whole numbers.

Learning objectives

By the end of this lesson, students, you should be able to:

explain the main ideas and vocabulary behind the Fundamental Theorem of Arithmetic,
use prime factorization to break numbers into prime factors,
connect the theorem to the study of prime numbers,
give examples that show why the factorization is unique,
use the theorem to solve number theory problems. 📘

Think of a number like $84$. You can write it as $2 \times 2 \times 3 \times 7$. You could also write it as $4 \times 21$, but those factors are not prime. The theorem says that if you keep factoring until every factor is prime, the prime factors you get are always the same, up to reordering. That is a powerful and surprising fact.

What are primes and composites?

A prime number is a whole number greater than $1$ that has exactly two positive divisors: $1$ and itself. Examples include $2$, $3$, $5$, $7$, $11$, and $13$.

A composite number is a whole number greater than $1$ that is not prime, meaning it has more than two positive divisors. Examples include $4$, $6$, $8$, $9$, $10$, and $12$.

The number $1$ is special. It is not prime and not composite. This matters because prime factorization works only for integers greater than $1$.

A helpful way to think about primes is to imagine them as the “atoms” of multiplication. Just as atoms combine to make all matter, primes combine to make all positive whole numbers greater than $1$. 🌟

For example:

$12 = 3 \times 4$, but $4$ is not prime.
Keep going: $4 = 2 \times 2$.
So $12 = 3 \times 2 \times 2 = 2^2 \times 3$.

That final form is a prime factorization.

Statement of the Fundamental Theorem of Arithmetic

The Fundamental Theorem of Arithmetic says:

Every integer greater than $1$ is either prime itself or can be written as a product of prime numbers. Also, this factorization is unique up to the order of the factors.

In symbols, if a number $n > 1$ is composite, then it can be written as

$$n = p_1 p_2 \cdots p_k$$

where each $p_i$ is prime. If you write $n$ in another prime factorization, the same primes must appear with the same powers, just possibly in a different order.

For example, $72$ can be written as

$$72 = 2 \times 2 \times 2 \times 3 \times 3$$

or as

$$72 = 2^3 \times 3^2.$$

No matter how you factor $72$ into primes, the result will always contain three $2$’s and two $3$’s.

This is why prime factorization is so important: it gives each number a unique prime “signature.” 🔍

How to find a prime factorization

A common method is to build a factor tree. Start with the number and keep splitting it into smaller factors until all the leaves are prime.

Example 1: Factor $60$

Start with $60$.

$$60 = 6 \times 10$$

Then factor each part:

$$6 = 2 \times 3, \quad 10 = 2 \times 5$$

$$60 = 2 \times 3 \times 2 \times 5 = 2^2 \times 3 \times 5.$$

You could use a different factor tree, such as

$$60 = 12 \times 5, \quad 12 = 3 \times 4, \quad 4 = 2 \times 2,$$

and you would still end up with

$$60 = 2^2 \times 3 \times 5.$$

That repeated answer shows uniqueness.

Example 2: Factor $84$

One route is

$$84 = 2 \times 42 = 2 \times 2 \times 21 = 2^2 \times 3 \times 7.$$

So the prime factorization is

$$84 = 2^2 \times 3 \times 7.$$

A useful check is to multiply the primes back together. If you get the original number, your factorization is correct.

Why the factorization is unique

The uniqueness part of the theorem is the key idea. It means you cannot have two different prime factorizations for the same number.

For example, suppose someone claims that

$$30 = 2 \times 3 \times 5$$

and also

$$30 = 2 \times 2 \times 15.$$

The second expression is not a prime factorization because $15$ is not prime. If we continue factoring, we get

$$30 = 2 \times 2 \times 3 \times 5$$

which is not equal to $30$. So the only prime factorization of $30$ is

$$30 = 2 \times 3 \times 5.$$

Another way to see uniqueness is through repeated factoring. If a number could be broken into primes in two truly different ways, then some prime would have to divide a product of other primes in a special way. But primes have a strong divisibility property: if a prime divides a product, it must divide one of the factors. This fact is part of why the theorem works.

A simple takeaway for students: once a factorization is fully prime, it is finished. You do not need to keep searching for a “different” one, because the theorem guarantees there is no different prime factorization waiting out there. ✅

Prime factorization in action

Prime factorization helps us solve many number theory problems.

Example 3: Is $45$ divisible by $9$?

First factorize:

$$45 = 3^2 \times 5$$

and

$$9 = 3^2.$$

Since $9$’s prime factors are contained in $45$’s factorization, $9$ divides $45$.

Example 4: Find the greatest common divisor of $18$ and $24$

Factor each number:

$$18 = 2 \times 3^2$$

$$24 = 2^3 \times 3$$

The greatest common divisor, written as $\gcd(18,24)$, uses the prime factors they share with the smallest exponents:

$$\gcd(18,24) = 2^1 \times 3^1 = 6.$$

This method works because the Fundamental Theorem of Arithmetic tells us the factorization is unique.

Example 5: Find the least common multiple of $18$ and $24$

Using the same factorizations,

$$18 = 2 \times 3^2, \quad 24 = 2^3 \times 3$$

the least common multiple, written as $\operatorname{lcm}(18,24)$, uses the largest exponents of each prime:

$$\operatorname{lcm}(18,24) = 2^3 \times 3^2 = 72.$$

This is useful in arithmetic, simplifying fractions, and solving timing problems like when two repeating events line up again. ⏰

How the theorem fits into the bigger picture of prime numbers

The topic of prime numbers is not just about listing primes. It is about understanding how primes control all whole numbers greater than $1$.

The Fundamental Theorem of Arithmetic gives primes a central role because it says every number is built from them. That means:

primes are the basic units of multiplication,
composite numbers are made from primes,
prime factorization is a reliable tool for studying divisibility,
many results in number theory depend on knowing a number’s prime structure.

This theorem also connects to other important ideas like coprime numbers, divisibility rules, fractions, and modular arithmetic. For example, when a fraction is reduced, you are often using prime factors without saying so directly.

Here is a quick example:

$$\frac{36}{48}$$

Factor each number:

$$36 = 2^2 \times 3^2, \quad 48 = 2^4 \times 3$$

Cancel shared factors to get

$$\frac{36}{48} = \frac{3}{4}.$$

The theorem makes this kind of simplification trustworthy because the prime factorization is unique.

Common mistakes to avoid

students, here are some errors students often make:

Thinking $1$ is prime. It is not.
Stopping too early in a factor tree before all factors are prime.
Writing a number in a factorized form that is not fully prime, such as $60 = 6 \times 10$ and calling it prime factorization.
Forgetting that the order of factors does not matter. For example, $2 \times 3 \times 5$ and $5 \times 2 \times 3$ are the same prime factorization.
Mixing up the ideas of prime factorization and a general factorization.

A good habit is to check each factor carefully and ask, “Can this still be broken into smaller whole-number factors greater than $1$?” If yes, keep factoring. If no, that factor is prime.

Conclusion

The Fundamental Theorem of Arithmetic tells us that every positive integer greater than $1$ can be written as a product of primes in exactly one way, except for the order of the primes. This makes prime numbers the foundation of all whole numbers. It also gives us practical tools for finding divisors, greatest common divisors, least common multiples, and simplifying fractions.

For students, the main idea to remember is simple but powerful: prime factors are the unique building blocks of numbers. Once you understand that, many number theory problems become easier and more organized. 🧠

Study Notes

A prime number has exactly two positive divisors: $1$ and itself.
A composite number has more than two positive divisors.
The number $1$ is neither prime nor composite.
The Fundamental Theorem of Arithmetic says every integer greater than $1$ is prime or can be written as a product of primes.
The prime factorization of a number is unique up to order.
Example: $72 = 2^3 \times 3^2$.
A factor tree is a method for finding prime factors.
Prime factorization helps find $\gcd$ and $\operatorname{lcm}$.
A number divides another number when its prime factors are contained in the other number’s prime factorization.
The theorem is central to the study of prime numbers because it shows primes are the building blocks of all whole numbers greater than $1$.