Historical Context & Motivation
The concepts of factors, multiples, and prime numbers are among the oldest and most enduring ideas in mathematics. Long before algebra or calculus existed, ancient civilizations grappled with questions of divisibility: How can a harvest be divided equally among workers? When do two periodic events coincide? These practical demands drove the development of a rich theory of number properties that remains central to mathematics education today. As a future educator preparing for the PRAXIS Core, understanding the deep roots and logical architecture of these concepts will strengthen both your test performance and your pedagogical clarity.
The central question these ideas address is deceptively simple: What is the internal multiplicative structure of a whole number, and how can we use that structure to relate two or more numbers? Mastering the answer equips you to simplify fractions, find common denominators, solve word problems involving cycles and grouping, and — crucially — to explain these processes to your own students with precision and confidence.
Core Principles & Definitions
Before diving into procedures, it is essential to anchor the vocabulary with precise definitions. The five key concepts in this lesson — factors, multiples, prime factorization, greatest common divisor, and least common multiple — form an interlocking system. Each concept depends on and illuminates the others, so a clear grasp of terminology will streamline every computation that follows.
Factors (Divisors)
Multiples
Prime Factorization
Greatest Common Divisor (GCD)
Least Common Multiple (LCM)
Visual Explanation — Factor Trees & Prime Factorization
A factor tree is the standard visual tool for decomposing a composite number into its prime factors. Starting from the original number at the top, each branch splits a composite into two factors; the process continues until every leaf is a prime. The diagram below illustrates factor trees for 60 and 84, the two numbers we will use throughout this lesson to demonstrate GCD and LCM calculations.
Notice that the path you choose through the factor tree does not affect the final result. You could start by splitting 60 into 4 × 15 instead of 2 × 30, and the prime leaves would still be {2, 2, 3, 5}. This invariance is precisely what the Fundamental Theorem of Arithmetic guarantees: the prime factorization is unique regardless of the decomposition order. Grasping this fact is pedagogically critical because students sometimes worry that different factor tree paths yield different answers. You can reassure them with confidence that the destination is always the same.
Mathematical Framework
The procedural backbone of this topic rests on four interconnected formulas and methods. Each builds on the notion of prime factorization, transforming what might otherwise be guesswork into an algorithmic, teachable procedure. Understanding these formulas at a structural level will help you not only solve PRAXIS items efficiently but also articulate the reasoning to students.
Detailed Breakdown — Comparing GCD and LCM Visually
One of the most effective ways to solidify the distinction between GCD and LCM is to align the prime factorizations side by side and examine which exponents are selected for each operation. The Venn-diagram approach — showing the shared and unshared prime factors — is widely used in classroom instruction and is particularly helpful for visual learners. The diagram below uses this approach for our running example of 60 and 84.
| Prime | Exponent in 60 | Exponent in 84 | min (→ GCD) | max (→ LCM) |
|---|---|---|---|---|
| 2 | 2 | 2 | 2 | 2 |
| 3 | 1 | 1 | 1 | 1 |
| 5 | 1 | 0 | 0 | 1 |
| 7 | 0 | 1 | 0 | 1 |
| Product | 60 | 84 | 12 | 420 |
The table above crystallizes the algorithm: list every prime that appears in either factorization, record the exponent (using 0 when a prime is absent), and then apply min for GCD or max for LCM. This systematic approach eliminates guesswork and scales effortlessly to three or more numbers — you simply extend the table with additional columns. On the PRAXIS, this tabular method is especially useful when the numbers are large enough that listing factors manually would be time-consuming.
Worked Example — GCD and LCM of 120 and 90
Let us apply the full procedure to a new pair of numbers — 120 and 90 — typical of the complexity you would encounter on the PRAXIS Core. We will find the prime factorization of each, then compute the GCD and LCM, and verify using the product identity.
Comparing Methods for Finding GCD and LCM
On the PRAXIS Core — and in your future classroom — you will want to choose the most efficient method for the numbers at hand. There are three principal approaches: the prime factorization method, the Euclidean algorithm, and the listing method. Each has distinct strengths and limitations, which the table below summarizes.
| Method | Best When… | Strengths | Limitations |
|---|---|---|---|
| Prime Factorization | Numbers are moderate-sized and factoring is straightforward (e.g., under 200) | Visual and systematic; yields both GCD and LCM simultaneously; reinforces number structure | Factoring large numbers can be slow; not practical for very large primes |
| Euclidean Algorithm | Numbers are large or you need only GCD (not LCM) | No factoring needed; very efficient; always terminates quickly | Gives GCD only — must use product identity for LCM; less intuitive for young learners |
| Listing Method | Numbers are small (under 30) or you want to verify other methods | Concrete and transparent; excellent for introductory instruction | Impractical for large numbers; easy to miss a factor or multiple |
Connections to the Broader Curriculum
Understanding GCD and LCM is not an end in itself; these concepts serve as essential tools across multiple domains of elementary and secondary mathematics. The PRAXIS Core values your ability to see these connections, and your future students will benefit immensely from an instructor who can seamlessly link number properties to fraction operations, ratio reasoning, and algebraic thinking.
| Application Area | How GCD/LCM Is Used | Example |
|---|---|---|
| Simplifying Fractions | Divide numerator and denominator by GCD to reduce to lowest terms | 84/120 → divide both by GCD(84,120)=12 → 7/10 |
| Adding/Subtracting Fractions | LCM of denominators gives the least common denominator (LCD) | 1/6 + 1/10: LCD = LCM(6,10) = 30, so 5/30 + 3/30 = 8/30 |
| Word Problems (Cycles) | LCM determines when two periodic events next coincide | Bus A every 12 min, Bus B every 18 min: both depart together every LCM(12,18) = 36 min |
| Distributing Items Evenly | GCD determines the largest group size for equal distribution | 48 apples and 36 oranges → largest identical bags: GCD(48,36)=12 bags |
| Algebraic Expressions | GCD of coefficients helps factor polynomial expressions | 12x³ + 18x² → GCD(12,18) = 6, so 6x²(2x + 3) |
Looking beyond the PRAXIS, these number properties connect to more advanced topics in abstract algebra (where GCD and LCM generalize to ideals in rings), cryptography (where prime factorization underpins RSA encryption), and computer science (where the Euclidean algorithm is a classic example of recursion and algorithmic efficiency). While these extensions are beyond the scope of the exam, awareness of them enriches your mathematical perspective and can inspire students who ask, 'When will I ever use this?'
Practice Problems
Lesson Summary
This lesson established the interconnected framework of factors, multiples, and prime factorization — anchored in the Fundamental Theorem of Arithmetic — as the foundation for computing the greatest common divisor (GCD) and least common multiple (LCM). The GCD is found by selecting the minimum exponent for each shared prime, while the LCM is found by selecting the maximum exponent for every prime present in either factorization.
Three computational methods were compared: prime factorization (visual and systematic), the Euclidean algorithm (efficient for large numbers), and the listing method (concrete and introductory). The product identity GCD(a, b) × LCM(a, b) = a × b provides both a computation shortcut and a verification tool. These number properties underpin fraction simplification, common denominators, cycle and grouping problems, and algebraic factoring — making them indispensable tools for any educator's mathematical repertoire.