Finding Prime Factors in Factorials or # of Numbers in Factorials
Finding the Number of Prime Factors in a Factorial
This section details a systematic method for determining the count of a specific prime factor within a given factorial.
Initial Approach and its Limitations
When asked to find the number of a particular prime factor in a factorial (e.g., how many twos are in ), a natural first thought might be to list out the factorial and count the multiples:
Example:
Multiples of :
An initial incorrect count might be .
Why this is incomplete: This simple count overlooks that numbers like contain more than one factor of ( has two twos), and contains even more ( has three twos). A more rigorous system is needed.
Example 1: Finding Twos in
To find the number of twos in :
Multiples of :
Numbers:
Count:
Multiples of :
Numbers:
Count:
Multiples of :
Numbers:
Count:
Multiples of :
Numbers: None (since 16 > 8)
Count:
Total Number of Twos:
The correct answer is .
Example 2: Finding Threes in
To find the number of threes in :
Multiples of :
Numbers:
Count:
Multiples of :
Numbers:
Count:
Multiples of :
Numbers: None (since 27 > 15)
Count:
Total Number of Threes:
Example 3: Finding Fives in
This method is especially useful for larger factorials where listing out numbers is impractical.
Multiples of :
Count:
Multiples of :
Count:
(Numbers: )
Multiples of :
Count:
Total Number of Fives:
Application Problem: Maximum Exponent
Question: If is an integer, what is the maximum value of ?
Rephrasing the question: This question is equivalent to asking: "How many threes are there in ?"
Applying the system for and prime :
Multiples of :
Count:
(Numbers: )
Multiples of :
Count:
(Numbers: )
Multiples of :
Count:
(Numbers: )
Multiples of :
Count:
Total Number of Threes:
Conclusion: The maximum value of is .