Fundamental theorem of arithmetic

In mathematics, the fundamental theorem of arithmetic is a big idea about numbers. It says that every whole number bigger than 1 is either a prime number or can be split into prime numbers in only one way. Prime numbers are special because they can only be divided evenly by 1 and themselves, like 2, 3, 5, and 7.

For example, the number 1200 can be written as 2 × 2 × 2 × 2 × 3 × 5 × 5. You could write it in a different order, like 5 × 2 × 5 × 2 × 3 × 2 × 2, but you will always end up with four 2s, one 3, and two 5s. This shows that the way we break the number into primes is always the same.

This theorem helps us understand why the number 1 is not a prime number. If 1 were a prime, we could keep multiplying by 1 forever, and the way to break numbers into primes would not be unique.

The fundamental theorem of arithmetic also helps mathematicians study more complex number systems. It made proving some big theorems, like Fermat's Last Theorem, very hard before it was solved.

History

The idea behind the fundamental theorem of arithmetic started with the ancient Greek mathematician Euclid. In his book called Elements, Euclid talked about numbers and prime numbers. He showed that if a prime number divides a product of two numbers, it must divide one of them. He also proved that every number larger than one can be divided by a prime number.

Later, other mathematicians added to Euclid's work. A mathematician named Kamāl al-Dīn al-Fārisī was the first to clearly state the fundamental theorem of arithmetic. Finally, Carl Friedrich Gauss gave a full proof of the theorem in his book Disquisitiones Arithmeticae.

Applications

Canonical representation of a positive integer

Every whole number bigger than 1 can be written in one special way by multiplying numbers called prime numbers. For example, 999 can be written as 3×3×3×37, and 1000 can be written as 2×2×2×5×5×5. This special way of writing numbers is called the canonical representation.

Arithmetic operations

When we multiply, find the greatest common divisor (GCD), or find the least common multiple (LCM) of two numbers, we can use their canonical representations to make it easier. For example, when multiplying two numbers, we just add the exponents of the same prime numbers together.

Arithmetic functions

Many math functions depend on how numbers can be broken down into prime factors. This helps us understand the properties of these functions.

Proof

The fundamental theorem of arithmetic tells us that every number bigger than 1 can be written as a product of prime numbers in only one way, even if we change the order.

To understand why, let’s look at two parts: existence and uniqueness.

Existence

First, we need to show that any number bigger than 1 can either be a prime number itself or can be broken down into a product of prime numbers.

Imagine we start with a number n bigger than 1. If n is prime, we are done. If not, we can write n as a product of two smaller numbers, say a and b. We can keep breaking these smaller numbers down until all the pieces are prime. Because each step uses smaller and smaller numbers, this process will always end with a product of primes.

Uniqueness

Next, we need to show that this breakdown is unique — meaning there is only one way to write the number as a product of primes, aside from the order.

Suppose, for a moment, there is a number that can be written in two different ways as a product of primes. Let’s pick the smallest such number and call it n. We can write n in two ways:

• As a product of primes p₁p₂…pⱼ
• As a product of different primes q₁q₂…qₖ

According to Euclid’s lemma, if a prime divides a product of two numbers, it must divide at least one of those numbers. Using this idea, we can show that the first prime in the first list (p₁) must match the first prime in the second list (q₁). If we remove these matching primes from both lists, we end up with a smaller number that also has two different prime factorizations — but this contradicts our choice of n as the smallest such number. Therefore, no such number n exists, and the factorization must be unique.

In short, the fundamental theorem of arithmetic tells us that every number greater than 1 can be written as a product of primes in exactly one way.

Generalizations

The Fundamental Theorem of Arithmetic has inspired many ideas in more advanced math. Mathematicians study special number systems where numbers can be broken down into smaller building blocks in unique ways.

In the 1800s, mathematicians found new number systems like Gaussian integers and Eisenstein integers. In these systems, numbers can also be broken down into special building blocks called primes, similar to ordinary whole numbers.

However, not all number systems follow this rule perfectly. For example, in one special system, the number 6 can be broken down in two different ways. This shows that the Fundamental Theorem of Arithmetic only works for certain kinds of number systems.

Mathematicians created new ideas like "ideals" to understand when and how unique factorization works in more complex number systems. These ideas helped us learn more about how numbers can be built from smaller parts.