3.1 Prime Factorization, GCF, and LCM

Key Takeaways

  • The Fundamental Theorem of Arithmetic states that every integer > 1 is prime or has a unique prime factorization.
  • The number 1 is neither prime nor composite; it has exactly 1 positive divisor.
  • GCF of 36 (2² × 3²) and 60 (2² × 3 × 5) is 2² × 3 = 12.
  • LCM of 36 and 60 is 2² × 3² × 5 = 180, finding the highest power of each prime.
  • Two integers are coprime if their GCF is 1, and in this case, their LCM is a × b.
Last updated: July 2026

Prime Numbers and the Fundamental Theorem of Arithmetic

Number theory is often considered the purest branch of mathematics, and at its heart are the prime numbers. A prime number is a positive integer greater than 1 that has exactly two distinct positive divisors: 1 and itself. Examples include 2, 3, 5, 7, 11, and 13. Notice that 2 is the only even prime number. Numbers that have more than two positive divisors are called composite numbers (e.g., 4, 6, 8, 9, 10). It is crucial to remember, and to emphasize to students, that the number 1 is neither prime nor composite because it has only one positive divisor.

The Fundamental Theorem of Arithmetic states that every integer greater than 1 either is a prime itself or can be uniquely factored into a product of primes, ignoring the order of the factors. This theorem highlights why primes are often called the "building blocks" of the integers. For example, the number 60 can be broken down into 2 × 2 × 3 × 5, or expressed with exponents as 2² × 3 × 5. No matter how you begin factoring 60, you will inevitably arrive at this exact collection of prime factors.

Methods of Prime Factorization

To find the prime factorization of a composite number, two common methods are widely taught in middle school mathematics: the factor tree method and the continuous division (or upside-down division) method.

1. Factor Tree Method: Start with the original number at the top. Find any two factors that multiply to give that number and draw branches down to them. If a factor is prime, circle it; the branch ends there. If a factor is composite, continue branching. For instance, to factor 72:

  • Break 72 into 8 and 9.
  • Break 8 into 2 and 4. Circle the 2.
  • Break 4 into 2 and 2. Circle both 2s.
  • Break 9 into 3 and 3. Circle both 3s. Collecting the circled primes yields 2 × 2 × 2 × 3 × 3 = 2³ × 3².

2. Continuous Division: Write the number and divide it by the smallest prime number that goes into it evenly. Write the quotient underneath. Continue dividing each new quotient by the smallest applicable prime until the quotient is 1. All the divisors on the outside represent the prime factorization. This method is highly systematic and reduces the likelihood of missing prime factors.

Greatest Common Factor (GCF) and Least Common Multiple (LCM)

The Greatest Common Factor (GCF), sometimes called the Greatest Common Divisor (GCD), of two or more integers is the largest positive integer that divides each of the numbers without a remainder. The Least Common Multiple (LCM) is the smallest positive integer that is a multiple of each of the numbers.

Using Prime Factorization: To find the GCF of two numbers, list their prime factorizations and multiply together the lowest power of each common prime factor. To find the LCM, multiply together the highest power of every prime factor present in either number. Example: Find the GCF and LCM of 36 and 60. 36 = 2² × 3² 60 = 2² × 3 × 5

  • GCF: The common primes are 2 and 3. The lowest powers are 2² and 3¹. Thus, GCF = 2² × 3 = 12.
  • LCM: The primes present are 2, 3, and 5. The highest powers are 2², 3², and 5¹. Thus, LCM = 2² × 3² × 5 = 180.

Venn Diagram Method: This visual method is fantastic for middle schoolers. Draw two overlapping circles. Place the prime factors shared by both numbers in the overlapping intersection. Place the remaining prime factors in the respective non-overlapping regions.

  • The GCF is the product of the numbers in the intersection.
  • The LCM is the product of all the numbers anywhere in the Venn diagram.

The Euclidean Algorithm: For very large numbers, prime factorization can be tedious. The Euclidean Algorithm is an efficient method for finding the GCF. It is based on the principle that the GCF of two numbers also divides their difference. To use it, divide the larger number by the smaller number. Then, replace the larger number with the smaller number and the smaller number with the remainder. Repeat this process until the remainder is 0. The last non-zero remainder is the GCF. Example: GCF of 252 and 105.

  • 252 ÷ 105 = 2 with a remainder of 42.
  • 105 ÷ 42 = 2 with a remainder of 21.
  • 42 ÷ 21 = 2 with a remainder of 0. The GCF is 21.

Word Problem Applications

Students must learn to identify whether a real-world scenario requires finding the GCF or the LCM.

GCF Applications: These typically involve dividing or cutting things into smaller, equal pieces, or organizing items into the largest possible identical groups without any leftovers.

  • Example: A florist has 48 roses and 72 tulips and wants to make identical bouquets with no flowers left over. What is the greatest number of bouquets they can make? (Find the GCF of 48 and 72).
  • Tiling problems: Finding the largest square tile that can exactly cover a rectangular floor of dimensions length L and width W.

LCM Applications: These typically involve events that repeat at different intervals, and you want to know when they will next happen at the same time, or finding the smallest quantity that can be purchased in multiple different pack sizes.

  • Example: Bus A arrives every 15 minutes and Bus B arrives every 20 minutes. If they both arrive at 8:00 AM, when will they next arrive together? (Find the LCM of 15 and 20).
  • Gear rotations: If a gear with 12 teeth is interlocked with a gear with 18 teeth, how many teeth must pass before the gears are aligned in their original starting positions? (Find the LCM of 12 and 18).

Student Misconceptions

A very common student misconception is confusing GCF and LCM, particularly in word problems. The source of the confusion is usually semantic. The word "Greatest" in GCF leads students to look for a large number, while "Least" in LCM leads them to look for a small number. However, the exact opposite is true in practice: the GCF of two numbers is less than or equal to the numbers, while the LCM is greater than or equal to the numbers.

To correct this, educators should emphasize the nouns "Factor" and "Multiple" rather than the adjectives. A factor is a part of a number (thus smaller), while a multiple is a product of a number and an integer (thus larger). Visualizing factors as pieces of a whole and multiples as repeated additions can help solidify this distinction.

Detailed Worked Examples and Teaching Scenarios

Worked Example 1: Advanced Prime Factorization

Let us consider a more complex number: 3,465. To find its prime factorization using continuous division, we start by checking the smallest prime, 2. Since 3,465 ends in 5, it is not divisible by 2. We next check 3. The sum of the digits is 3 + 4 + 6 + 5 = 18, which is divisible by 3, so 3,465 is divisible by 3. 3,465 / 3 = 1,155. Checking 1,155 for divisibility by 3: 1 + 1 + 5 + 5 = 12, so yes. 1,155 / 3 = 385. Checking 385 for divisibility by 3: 3 + 8 + 5 = 16, no. The next prime is 5. Since 385 ends in 5, it is divisible by 5. 385 / 5 = 77. We immediately recognize 77 as divisible by 7. 77 / 7 = 11, which is a prime. So the prime factorization of 3,465 is 3 * 3 * 5 * 7 * 11, or 3^2 * 5 * 7 * 11. This structured approach prevents students from guessing and missing factors.

Teaching Scenario: The "Locker Problem"

A classic middle school mathematics problem that beautifully illustrates factors is the "Locker Problem." Imagine a school with 100 lockers and 100 students. The first student opens every locker. The second student closes every second locker (2, 4, 6...). The third student changes the state of every third locker (opens if closed, closes if open). This continues until the 100th student changes the 100th locker. Which lockers remain open at the end?

When teaching this, have students simulate the first 20 lockers using two-sided counters. They will quickly observe a pattern: only lockers 1, 4, 9, and 16 remain open. Why? A locker is touched exactly as many times as it has factors. For example, locker 12 is touched by students 1, 2, 3, 4, 6, and 12 (6 times, an even number, so it ends up closed). Lockers that remain open must have an odd number of factors. The only numbers with an odd number of factors are perfect squares (like 16, whose factors are 1, 2, 4, 8, 16). The factor 4 pairs with itself, resulting in an odd total count. This connects prime factorization directly to perfect squares and provides a memorable "Aha!" moment.

Additional Practice and Deep Dive into GCF/LCM Word Problems

Consider this word problem: "A baker has 150 chocolate chip cookies, 90 peanut butter cookies, and 120 oatmeal raisin cookies. He wants to create identical boxes of cookies with no cookies left over. What is the greatest number of boxes he can make, and how many of each cookie will be in each box?"

This requires finding the GCF of 150, 90, and 120. Prime factorizations: 150 = 2 * 3 * 5^2 90 = 2 * 3^2 * 5 120 = 2^3 * 3 * 5 The common primes are 2, 3, and 5. The lowest powers are 2^1, 3^1, and 5^1. GCF = 2 * 3 * 5 = 30. He can make 30 identical boxes. Inside each box: Chocolate chip: 150 / 30 = 5 Peanut butter: 90 / 30 = 3 Oatmeal raisin: 120 / 30 = 4. This extends the GCF concept beyond just finding the number, requiring students to interpret the result in the context of the problem.

Another problem: "Planets X, Y, and Z orbit a star. Planet X takes 8 years, Planet Y takes 12 years, and Planet Z takes 18 years to complete an orbit. If they are aligned today, in how many years will they align again?" This requires the LCM of 8, 12, and 18. 8 = 2^3 12 = 2^2 * 3 18 = 2 * 3^2 LCM uses the highest powers of all present primes: 2^3 * 3^2 = 8 * 9 = 72. They will align in 72 years. Teaching tip: Use physical models or software simulations of orbits to help visual learners see the periods syncing up at the LCM. This makes abstract number theory tangible and exciting for middle schoolers.

Understanding Coprime Numbers

It is also essential to teach the concept of relatively prime, or coprime, numbers. Two integers are coprime if their GCF is 1. For example, 15 and 28 are coprime because 15 = 3 * 5 and 28 = 2^2 * 7. They share no prime factors. When two numbers a and b are coprime, their LCM is simply their product, a * b (e.g., LCM of 15 and 28 is 15 * 28 = 420). This is a powerful shortcut for students to learn. Furthermore, consecutive integers (e.g., 20 and 21) are always coprime, which is a neat property to have students discover on their own.

By layering these advanced examples, teaching scenarios, and properties, educators provide a rich, multi-dimensional understanding of prime numbers, factors, and multiples that goes far beyond rote memorization.

Test Your Knowledge

Two interlocking gears have 14 teeth and 21 teeth respectively. If a specific tooth on the smaller gear and a specific tooth on the larger gear are perfectly aligned, how many teeth must pass on the smaller gear before these same two teeth are perfectly aligned again?

A
B
C
D
Test Your Knowledge

What is the Greatest Common Factor (GCF) of the numbers 120 and 150?

A
B
C
D
Test Your Knowledge

When teaching GCF and LCM, which of the following is a common source of student misconception?

A
B
C
D