PRIME FACTORIZATION AND THE NUMBER OF FACTORS
In Section 8.1, you learned about prime and composite numbers. In this project, you will explore a way to determine the number of factors a number has by using its prime factorization.
-
Find the prime factorization of . How many times does each prime factor appear in the prime factorization? Find all possible factors of . How many total factors are there?
-
Find the prime factorization of , and then find all factors of . How many times does each prime factor appear in the prime factorization? How many total factors are there?
It's possible that in parts 1 and 2 you determined the total number of factors by using a brute-force method to list each factor. Let's explore a systematic way to determine the total number of factors.
-
Does any factor in the list of factors of have prime factors that are not listed in the prime factorization of ? Similarly, does any factor in the list of factors of have prime factors that are not listed in the prime factorization of ? Explain why it is or isn't possible for the factors to have a prime factor that is not listed in the prime factorization.
Consider the number , which has a prime factorization of . We can create the factors of by choosing how many s and s we wish to have in the prime factorization of each individual factor.
-
Find the factors of that have no s in their prime factorization.
-
Find the factors of that have exactly one in their prime factorization.
-
Find the factors of that have exactly two s in their prime factorization.
-
Find the factors of that have exactly three s in their prime factorization.
If you combine the factors found in parts 4 through 7 into a list, you will have all of the factors of .
-
How many factors appear in each set of factors in parts 4 through 7? How does this number compare to the number of times appears in the prime factorization of ?
-
How many sets of factors did we find in parts 4 through 7? How does this compare to the number of times appears in the prime factorization of ?
-
Use the answers to parts 8 and 9 to create an algebraic expression to describe how the total number of factors of compares to the number of s and number of s in the prime factorization of .
-
Can you use the same logic to find an algebraic expression to describe how the total number of factors compares to the prime factorizations of and ? If so, write an expression for each.
-
Find a general rule that gives the number of factors of a given number based on its prime factorization. (Hint: Let , , and so on represent the prime factors in the prime factorization.)
-
Find the number of factors of using the prime factorization. Compare using the formula to the brute-force method of listing every factor.