Prime Powers and Divisor Structure

Prime factorization turns a large integer into a small collection of exponent choices. Those choices reveal its divisors, perfect powers, and hidden factors inside products.

What you will learn

• Analyze prime exponents
• Count divisors
• Apply factor constraints

Keep paper and a pencil nearby. Try each problem before opening a hint, and mark sections reviewed as you work through them.

A divisor is a choice of exponents

Every positive integer greater than one has a unique factorization into primes, apart from the order of the factors. If an integer contains $p^a$, a divisor may contain $p$ to any exponent from zero through $a$. Choosing exponent zero means leaving that prime out. Choices for different primes are independent, so multiplication counts the complete set of positive divisors.

For $N=p^a q^b$ with different primes, the divisor count is $(a+1)(b+1)$. The added ones include zero exponents, not an extra prime factor. To impose a condition such as divisibility by a given number, restrict the allowed exponents first and only then multiply the counts.

Perfect powers and shared factors

A positive integer is a square exactly when every prime exponent is even. A cube requires every exponent to be divisible by three. Thus counting square divisors means counting even exponent options at each prime. To make an integer a square by multiplying, supply precisely the primes whose exponents are odd; adding unnecessary factors makes the multiplier larger.

The greatest common divisor of two integers takes the smaller exponent at each prime, because a shared divisor cannot exceed either supply. The least common multiple takes the larger exponent, because it must contain both supplies. These descriptions explain the formulas and prevent confusing a shared factor with a common multiple.

Count prime contributions in a factorial

A factorial multiplies all positive integers up to its input. To count factors of a prime $p$, first count the multiples of $p$. Each contributes at least one copy. Multiples of $p^2$ contribute an additional copy, multiples of $p^3$ another, and so on. Add these nested counts rather than counting each multiple only once.

Trailing decimal zeros come from factors of ten, each requiring a pair consisting of a two and a five. In a factorial there are at least as many twos as fives, so fives are the limiting supply. In a general product you must compare both counts instead of automatically counting fives.

See the reasoning unfold

Pause after each step and predict what comes next.

Common mistakes to catch

• Omitting zero from the list of allowed prime exponents.
• Counting each multiple of a prime only once inside a factorial.
• Using maximum rather than minimum exponents for a GCD.

Try with support

Guided practice

Choose a strategy, take a first step, and use the hints when you need direction.

Put it into practice

Independent practice

Work on your own first. If you reveal a solution, work through it and mark it reviewed.

Bring it together

• Prime exponents encode divisibility.
• Restrict exponent choices to count special divisors.
• Add all prime-power layers when analyzing a factorial.