Factors, primes, GCF, and LCM

A factor divides a whole number with no remainder. A prime number has exactly two positive factors, $1$ and itself. Every whole number greater than $1$ can be written as a product of primes, and that prime factorization is unique apart from order.

The greatest common factor answers a shared-grouping question: what is the largest factor contained in every number? In prime-exponent form, take only primes shared by all numbers and use the smallest exponent present.

The least common multiple answers a first-alignment question: what is the smallest positive multiple reached by every number? In prime-exponent form, include every needed prime and use the largest exponent present. Context tells you whether to seek a common divisor or a common multiple.

Prime factorization turns a whole number into an inventory of indivisible multiplicative building blocks. A factor tree may branch in different ways, but every complete tree ends with the same prime factors apart from order. For $360,$ starting with $36\cdot 10$ or $45\cdot 8$ eventually produces $2^{3}\cdot 3^{2}\cdot 5$. This uniqueness is why prime exponents can be used reliably to compare divisibility, simplify fractions, build common denominators, and later factor algebraic expressions. A factorization is complete only when every remaining factor is prime.

The greatest common factor is constructed by asking what every number can supply. If $84 = 2^{2}\cdot 3\cdot 7$ and $126 = 2\cdot 3^{2}\cdot 7,$ both numbers contain at least one $2,$ one $3,$ and one $7$. They do not both contain a second $2$ or a second $3$. Taking the smaller exponent of each shared prime gives $2\cdot 3\cdot 7 = 42$. In a grouping context, this means $42$ is the largest number of identical groups that can be formed without leftovers.

The least common multiple asks the opposite inventory question: what is the smallest product large enough to contain each input’s complete prime factorization? Use every prime that appears and the largest exponent required by any input. For $12 = 2^{2}\cdot 3$ and $18 = 2\cdot 3^{2},$ the smallest shared multiple needs $2^{2}$ and $3^{2},$ so it is $36$. In a timing context, $36$ is the first positive point at which cycles of $12$ and $18$ align.

Context determines whether a problem calls for a divisor or a multiple. Words such as “largest identical groups,” “greatest equal side,” or “cut with no waste” suggest a GCF. Words such as “first time together,” “smallest common denominator,” or “repeat on the same day” suggest an LCM. A quick size check helps: the GCF cannot exceed the smallest positive input, while the LCM cannot be smaller than the largest positive input.

Prime exponents also make divisibility arguments transparent. A number is divisible by $72 = 2^{3}\cdot 3^{2}$ only if its factorization contains at least three factors of $2$ and two factors of $3$. This same minimum-versus-maximum reasoning will reappear when rational expressions are simplified and when polynomial factors are compared. Keep the factorization beside the original numbers and multiply it back at the end; reconstructing the input catches missing or duplicated primes.

Lists of factors and multiples can solve small cases, but prime powers explain why the method works and scale to larger numbers. For two positive integers a and b, the product $GCF(a,b)\cdot LCM(a,b)$ equals $a\cdot b$. This identity provides a useful check: after finding the GCF, divide $a\cdot b$ by it to recover the LCM. It also shows why the shared prime powers cannot be counted twice in the LCM. The GCF holds one copy of the overlap; the LCM holds enough factors to satisfy both complete inventories.

Grouping problems may have more than two constraints. If $72$ red cards, $108$ blue cards, and $180$ green cards must be divided into the greatest possible number of identical packets, the number of packets is $GCF(72,108,180)$. Each packet then receives the original count divided by that GCF. Timing problems work dually: for three repeating cycles, take the maximum exponent of every prime appearing anywhere. Always answer the second contextual question too—what goes in each group, or what clock time corresponds to the elapsed LCM—rather than stopping at an unlabeled integer.