What is the formula for the number of divisors?

Understanding how to find the number of divisors of a given number can be very useful in various mathematical applications. Let’s break it down step by step.

Prime Factorization

The first step in finding the number of divisors of a number is to perform its prime factorization. Prime factorization is expressing the number as a product of prime numbers.

For example, let’s consider the number 60:

$60 = 2^2 times 3^1 times 5^1$

Applying the Formula

Once you have the prime factorization, the formula to find the number of divisors is straightforward. If a number $N$ can be expressed as:

$N = p_1^{e_1} times p_2^{e_2} times text{…} times p_k^{e_k}$

where $p_1, p_2, text{…}, p_k$ are prime factors and $e_1, e_2, text{…}, e_k$ are their respective exponents, then the number of divisors $D(N)$ can be calculated using:

$D(N) = (e_1 + 1)(e_2 + 1) text{…} (e_k + 1)$

Example Calculation

Let’s use the formula to find the number of divisors of 60. We already have the prime factorization:

$60 = 2^2 times 3^1 times 5^1$

Now, apply the formula:

$D(60) = (2+1)(1+1)(1+1)$

$D(60) = 3 times 2 times 2$

$D(60) = 12$

So, the number 60 has 12 divisors.

Why Does This Work?

The reason this formula works is because each divisor of $N$ can be formed by choosing any combination of the prime factors raised to a power less than or equal to their respective exponents. For instance, for the number 60, the divisors include 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, and 60.

Generalization

This method can be applied to any positive integer. The key steps are:

1. Find the prime factorization of the number.
2. Use the exponents in the prime factorization in the formula $(e_1 + 1)(e_2 + 1) text{…} (e_k + 1)$

Another Example

Let’s try another example to ensure the concept is clear. Consider the number 84.

First, find its prime factorization:

$84 = 2^2 times 3^1 times 7^1$

Now, apply the formula:

$D(84) = (2+1)(1+1)(1+1)$

$D(84) = 3 times 2 times 2$

$D(84) = 12$

So, the number 84 also has 12 divisors.

Conclusion

Finding the number of divisors of a number is a useful and interesting exercise in number theory. By understanding the prime factorization and applying the formula, you can quickly determine the number of divisors for any positive integer. This knowledge can be particularly useful in solving problems related to factors and multiples in mathematics.

Citations

1. 1. Khan Academy – Prime factorization
2. 2. Math is Fun – Divisors
3. 3. Wolfram Alpha – Divisor Function