# Finding the Prime Factorization of a Composite Number

### Learning Outcomes

- Find the prime factorization of a number using the factor tree method
- Find the prime factorization of a number using the ladder method

### Prime Factorization

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 [latex]50[/latex] as you work through this section. [latex-display]2,3,5,7,11,13,17,19,23,29,31,37,41,43,47[/latex-display]**Tip**: Knowing the first five prime numbers will come in handy when reducing fractions.

### Prime Factorization Using the Factor Tree Method

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 [latex]36[/latex]. We can start with any factor pair such as [latex]3[/latex] and [latex]12[/latex]. We write [latex]3[/latex] and [latex]12[/latex] below [latex]36[/latex] with branches connecting them. The factor [latex]3[/latex] is prime, so we circle it. The factor [latex]12[/latex] is composite, so we need to find its factors. Let’s use [latex]3[/latex] and [latex]4[/latex]. We write these factors on the tree under the [latex]12[/latex]. The factor [latex]3[/latex] is prime, so we circle it. The factor [latex]4[/latex] is composite, and it factors into [latex]2\cdot 2[/latex]. We write these factors under the [latex]4[/latex]. Since [latex]2[/latex] is prime, we circle both [latex]2\text{s}[/latex]. The prime factorization is the product of the circled primes. We generally write the prime factorization in order from least to greatest.[latex]2\cdot 2\cdot 3\cdot 3[/latex]

In cases like this, where some of the prime factors are repeated, we can write prime factorization in exponential form.[latex]\begin{array}{c}2\cdot 2\cdot 3\cdot 3\\ \\ {2}^{2}\cdot {3}^{2}\end{array}[/latex]

Note that we could have started our factor tree with any factor pair of [latex]36[/latex]. We chose [latex]12[/latex] and [latex]3[/latex], but the same result would have been the same if we had started with [latex]2[/latex] and [latex]18,4[/latex] and [latex]9,\text{or}6\text{and}6[/latex].### Find the prime factorization of a composite number using the tree method

- Find any factor pair of the given number, and use these numbers to create two branches.
- If a factor is prime, that branch is complete. Circle the prime.
- If a factor is not prime, write it as the product of a factor pair and continue the process.
- Write the composite number as the product of all the circled primes.

### example

Find the prime factorization of [latex]48[/latex] using the factor tree method. Solution:We can start our tree using any factor pair of [latex]48[/latex]. Let's use [latex]2\text{ and }24[/latex]. We circle the [latex]2[/latex] because it is prime and so that branch is complete. | |

Now we will factor [latex]24[/latex]. Let's use [latex]4\text{ and }6[/latex]. | |

Neither factor is prime, so we do not circle either.We factor the [latex]4[/latex], using [latex]2\text{ and }2[/latex]. We factor [latex]6\text{, using }2\text{ and }3[/latex]. We circle the [latex]2\text{s and the }3[/latex] since they are prime. Now all of the branches end in a prime. | |

Write the product of the circled numbers. | [latex]2\cdot 2\cdot 2\cdot 2\cdot 3[/latex] |

Write in exponential form. | [latex]{2}^{4}\cdot 3[/latex] |

### try it

[ohm_question]146554[/ohm_question]### example

Find the prime factorization of [latex]84[/latex] using the factor tree method.Answer: Solution:

We start with the factor pair [latex]4\text{ and }21[/latex]. Neither factor is prime so we factor them further. | |

Now the factors are all prime, so we circle them. | |

Then we write [latex]84[/latex] as the product of all circled primes. | [latex]2\cdot 2\cdot 3\cdot 7[/latex] [latex]{2}^{2}\cdot 3\cdot 7[/latex] |

## Prime Factorization Using the Ladder Method

The ladder method is another way to find the prime factors of a composite number. It leads to the same result as the factor tree method. Some people prefer the ladder method to the factor tree method, and vice versa. To begin building the "ladder," divide the given number by its smallest prime factor. For example, to start the ladder for [latex]36[/latex], we divide [latex]36[/latex] by [latex]2[/latex], the smallest prime factor of [latex]36[/latex]. To add a "step" to the ladder, we continue dividing by the same prime until it no longer divides evenly. Then we divide by the next prime; so we divide [latex]9[/latex] by [latex]3[/latex]. We continue dividing up the ladder in this way until the quotient is prime. Since the quotient, [latex]3[/latex], is prime, we stop here. Do you see why the ladder method is sometimes called stacked division? The prime factorization is the product of all the primes on the sides and top of the ladder.[latex]\begin{array}{c}2\cdot 2\cdot 3\cdot 3\\ \\ {2}^{2}\cdot {3}^{2}\end{array}[/latex]

Notice that the result is the same as we obtained with the factor tree method.

### Find the prime factorization of a composite number using the ladder method

- Divide the number by the smallest prime.
- Continue dividing by that prime until it no longer divides evenly.
- Divide by the next prime until it no longer divides evenly.
- Continue until the quotient is a prime.
- Write the composite number as the product of all the primes on the sides and top of the ladder.

### example

Find the prime factorization of [latex]120[/latex] using the ladder method.Answer: Solution:

Divide the number by the smallest prime, which is [latex]2[/latex]. | |

Continue dividing by [latex]2[/latex] until it no longer divides evenly. | |

Divide by the next prime, [latex]3[/latex]. | |

The quotient, [latex]5[/latex], is prime, so the ladder is complete. Write the prime factorization of [latex]120[/latex]. | [latex]2\cdot 2\cdot 2\cdot 3\cdot 5[/latex] [latex]{2}^{3}\cdot 3\cdot 5[/latex] |

### example

Find the prime factorization of [latex]48[/latex] using the ladder method.Answer: Solution:

Divide the number by the smallest prime, [latex]2[/latex]. | |

Continue dividing by [latex]2[/latex] until it no longer divides evenly. | |

The quotient, [latex]3[/latex], is prime, so the ladder is complete. Write the prime factorization of [latex]48[/latex]. | [latex]2\cdot 2\cdot 2\cdot 2\cdot 3[/latex] [latex]{2}^{4}\cdot 3[/latex] |

## Contribute!

Did you have an idea for improving this content? We’d love your input.

## Licenses & Attributions

### CC licensed content, Original

- Question ID 145453, 145452, 146553, 146554.
**Authored by:**Lumen Learning.**License:**CC BY: Attribution.**License terms:**IMathAS Community License.

### CC licensed content, Shared previously

- Ex 1: Prime Factorization.
**Authored by:**James Sousa (Mathispower4u.com).**License:**CC BY: Attribution. -
**Authored by:**James Sousa (Mathispower4u.com).**License:**CC BY: Attribution.

### CC licensed content, Specific attribution

- Prealgebra.
**Provided by:**OpenStax**License:**CC BY: Attribution.**License terms:**Download for free at http://cnx.org/contents/[email protected].