Fundamental Theorem of Arithmetic: Unique Prime Factorization

What Is Fundamental Theorem of Arithmetic?

The fundamental theorem of arithmetic states that prime decomposition is unique for every integer greater than $1$.

To understand this theorem, we can break it into three main parts. First, it applies only to integers greater than $1$. Second, it guarantees that any composite number can be broken down into a product of prime factors. Third, and most importantly, it guarantees that there is exactly one specific set of prime factors for each number.

No two different numbers share the exact same prime factorization.

For example, the number $30$ is factored as $2 \times 3 \times 5$. There are no other prime numbers that can be multiplied together to yield $30$.

Key Ideas and Vocabulary

To apply the theorem correctly, several mathematical concepts must be clearly defined.

• Prime Number: An integer greater than $1$ that has exactly two positive divisors: $1$ and itself. Examples include $2, 3, 5, 7, 11$, and $13$.
• Composite Number: An integer greater than $1$ that is not prime. It can be divided by numbers other than $1$ and itself. Examples include $4, 6, 8, 9$, and $10$.
• Prime Factorization: The process of finding the specific set of prime numbers that multiply together to form the original composite number.
• Ignoring the Order: The theorem states the factorization is unique regardless of how the factors are arranged. Writing $2 \times 5$ is considered the same prime factorization as $5 \times 2$.
• Exponent Notation: When a prime factor is repeated, we use exponents to write the product more efficiently. Instead of writing $12 = 2 \times 2 \times 3$, we write $12 = 2^2 \times 3$.

Visual Explanation

A factor tree provides an excellent visual model of the fundamental theorem of arithmetic. Because the prime factorization is unique, you can start a factor tree with any valid pair of factors and you will always arrive at the exact same prime numbers at the bottom of the branches.

Consider the number $60$. Two students might choose to break it down using different starting factors. One starts with $6 \times 10$, while the other starts with $4 \times 15$.

Even though the branches are different, both methods yield two $2$s, one $3$, and one $5$. The final prime factorization is uniquely $2^2 \times 3 \times 5$.

Worked Examples

The process of finding a unique prime factorization requires dividing by prime numbers until the final quotient is a prime number.

Example 1: Finding prime factors

Question: Write the prime factorization of $90$.

Method:

1. Divide $90$ by the smallest prime, which is $2$. This gives $45$.
2. $45$ is not divisible by $2$. The next smallest prime is $3$. Divide $45$ by $3$ to get $15$.
3. Divide $15$ by $3$ again to get $5$.
4. $5$ is a prime number, so the process is complete.
5. Gather all the prime divisors: $2, 3, 3$, and $5$.

Answer: The prime factorization is $2 \times 3^2 \times 5$.

Check: Multiply the factors to confirm: $2 \times 9 = 18$, and $18 \times 5 = 90$.

Example 2: Repeated division for larger numbers

Question: What is the prime factorization of $504$?

Method:

1. Since $504$ is even, divide by $2$ to get $252$.
2. Divide by $2$ again to get $126$.
3. Divide by $2$ again to get $63$.
4. $63$ is odd. The next prime is $3$. Divide by $3$ to get $21$.
5. Divide by $3$ again to get $7$.
6. $7$ is a prime number, completing the division.

Answer: The prime factorization is $2^3 \times 3^2 \times 7$.

Check: Calculate $8 \times 9 \times 7$. Since $8 \times 9 = 72$, we find $72 \times 7 = 504$.

Example 3: Reconstructing a number from its factors

Question: A number has the prime factorization $2^2 \times 5 \times 11$. What is the original number?

Method:

1. Expand the exponents into a repeated multiplication: $2 \times 2 \times 5 \times 11$.
2. Multiply the first pair: $2 \times 2 = 4$.
3. Multiply by the next factor: $4 \times 5 = 20$.
4. Multiply by the final factor: $20 \times 11 = 220$.

Answer: The original number is $220$.

Check: Verify that $220$ divides evenly by its factors $2, 4, 5$, and $11$.

Common Mistakes and Non-Examples

When applying the fundamental theorem of arithmetic, avoid these common errors.

Including $1$ in the factorization

The number $1$ is not a prime number. Writing $15 = 1 \times 3 \times 5$ is incorrect because the theorem strictly defines a product of prime numbers. If $1$ were prime, factorizations would not be unique because you could include any number of $1$s, such as $1 \times 1 \times 1 \times 3 \times 5$.

Stopping at composite factors

A factorization is only complete when every factor is a prime number.

Treating reordered factors as unique

The order of multiplication does not create a new factorization. Writing $3 \times 5 \times 7$ is exactly the same as writing $7 \times 3 \times 5$. By mathematical convention, we usually list prime factors in ascending order from smallest to largest to easily recognize the unique set.

Real-World Connections

The fundamental theorem of arithmetic is not just an abstract rule; it forms the foundation for many practical mathematical procedures.

When simplifying fractions, breaking the numerator and denominator into their prime factorizations reveals exactly which factors can be canceled. This makes finding the simplest form straightforward.

Prime factorization is also the most reliable method for finding the GCF and LCM of large numbers. By analyzing which prime factors two numbers share, you can immediately determine whether they are coprime numbers, meaning they share no prime factors other than $1$.

Advanced applications include computer cryptography. Secure online communications rely heavily on the fact that while multiplying two large prime numbers is easy for a computer, determining the unique prime factors of an incredibly large composite number is extremely difficult and time-consuming. These concepts lay the groundwork for learning the Euclidean algorithm to compute the greatest common divisor efficiently, and analyzing perfect numbers through their exact divisors.