Prime factorization turns divisibility into a question about exponents. It supports efficient calculations with factors, multiples, simplified fractions, and integer constraints.
Build a'-factor inventory
A prime integer has exactly two positive divisors; 1 is not prime. Every integer greater than 1 has a unique prime factorization apart from order. For example,
A positive divisor of 360 can choose zero through three factors of 2, zero through two factors of 3, and zero or one factor of 5. It cannot introduce another prime or use more copies than 360 contains. This explains both how divisors are formed and why prime factorization is useful.
To test whether a positive integer is prime, it suffices to test prime divisors no larger than its square root. If a composite number were a product of two factors both larger than its square root, their product would exceed the number. For 97, test 2, 3, 5, and 7; none divides it, so 97 is prime.
Example: common factors and common multiples
Let and A common divisor uses only shared primes and takes at most the smaller exponent for each:
A common multiple must supply the larger exponent for each prime in either number:
These rules include missing primes by treating their exponent as zero. For example, a lacks 7, so no factor of 7 can occur in the GCF.
For two positive integers, Each prime's smaller and larger exponents add to the same sum as the two original exponents. This proves the identity rather than merely providing a mnemonic.
Example: count positive divisors
How many positive divisors does 360 have? From there are four choices for the exponent of 2, three for 3, and two for 5. Each choice gives one distinct divisor, so there are
The zero-exponent choices matter: choosing all zeros produces 1, and choosing all largest exponents produces 360 itself. This count concerns positive divisors; including negative divisors would double it.
A perfect square has even exponents in its prime factorization. Consequently, the smallest positive integer multiplying 360 into a square is making Add one copy of each prime with an odd exponent; do not multiply by every prime indiscriminately.
Use a story to choose the operation
If 84 red tiles and 126 blue tiles must be divided into the greatest number of identical collections, use their GCF, 42. Each collection has 2 red and 3 blue tiles. If two processes repeat every 84 and 126 minutes, their next joint repetition occurs at their LCM, 252 minutes.
The first unknown divides both counts; the second is divisible by both periods. Identifying this relationship is more reliable than guessing from the words “greatest” or “least.”
Coprime factors and a divisibility constraint
If positive integers a and are relatively prime, their GCF is 1, so their LCM is ab. Therefore a number divisible by both 8 and 9 must be divisible by 72. The coprime condition matters: a number divisible by 8 and 12 need only be divisible by 24, their LCM, rather than 96.
For example, find the smallest positive integer N such that and are both integers. N must be a common multiple of 12 and 18. Their factorizations are and so the least possible N is
Now change the request: both and must be integers. N must instead be a common divisor, and the greatest possible N is 6. Similar-looking fractions place N in different roles. Translate “is an integer” into a divisibility statement before choosing a greatest-common-factor or least-common-multiple calculation.
Try it yourself
For find the number of positive divisors and the smallest positive multiplier making a square.
Answer: There are divisors. Only the exponent of 3 is odd, so multiply by 3. The product is
What to remember
A divisor cannot exceed a number's prime inventory. Use exponent minima for GCF, maxima for LCM, independent exponent choices to count divisors, and even exponents to recognize squares.