<< Chapter < Page | Chapter >> Page > |
Before you get started, take this readiness quiz.
In the previous section, we found the factors of a number. Prime numbers have only two factors, the number and the prime number itself. Composite numbers have more than two factors, and every composite number can be written as a unique product of primes. This is called the prime factorization of a number. When we write the prime factorization of a number, we are rewriting the number as a product of primes. Finding the prime factorization of a composite number will help you later in this course.
The prime factorization of a number is the product of prime numbers that equals the number.
You may want to refer to the following list of prime numbers less than as you work through this section.
One way to find the prime factorization of a number is to make a factor tree . We start by writing the number, and then writing it as the product of two factors. We write the factors below the number and connect them to the number with a small line segment—a “branch” of the factor tree.
If a factor is prime, we circle it (like a bud on a tree), and do not factor that “branch” any further. If a factor is not prime, we repeat this process, writing it as the product of two factors and adding new branches to the tree.
We continue until all the branches end with a prime. When the factor tree is complete, the circled primes give us the prime factorization.
For example, let’s find the prime factorization of We can start with any factor pair such as and We write and below with branches connecting them.
The factor is prime, so we circle it. The factor is composite, so we need to find its factors. Let’s use and We write these factors on the tree under the
The factor is prime, so we circle it. The factor is composite, and it factors into We write these factors under the Since is prime, we circle both
The prime factorization is the product of the circled primes. We generally write the prime factorization in order from least to greatest.
In cases like this, where some of the prime factors are repeated, we can write prime factorization in exponential form.
Note that we could have started our factor tree with any factor pair of We chose and but the same result would have been the same if we had started with and and
Notification Switch
Would you like to follow the 'Prealgebra' conversation and receive update notifications?