Bunuel
If p is a prime number and p! has more than 100 but less than 1,000 positive odd factors, how many different values can p take ?
A. 1
B. 2
C. 3
D. 5
E. 7
If a number on prime factorization = a^p * b^q * c^r, then total number of factors = (p+1)(q+1)(r+1)
But if you want to find the number of odd factors, then only take the odd bases into consideration
For example
30 = 3*5*2
Total factors = 2*2*2 = 8
Odd factors = 2*2 = 4 (Did not take the 2 into consideration because it is even and we want only odd factors)
So now, coming to the question at hand, best would be to consider some values > 7 because 7! only has two 3(s), one 7 and one 5 which will be less than 100:
11! = 11 x 10 x 9 x 8 x 7 x 6 x 5 x 4 x 3 x 2 = 11 x (2x5) x (3x3) x (2x2x2) x (7) x (3x2) x (5) x (2x2) x (3) x (2)
Taking out all the odd bases and their powers = 11 x 7 x 5^2 x 3^4
Odd factors = 2 x 2 x 3 x 5 = 60 Less than 100
13! = 13 x 12 x 11! = 13 x (2^2 x 3) x 11!: So we add a 2 for 13 and add 1 to the exponent of 3 in 11! = 2 x 2 x 3 x 6 x 2 = 144
YES (1)
17! = 17 x 16 x 15 x 14 = 17 x (2^4) x (3x5) x (2x7) = So we add a 2 for 17, increase the exponent of 5 by 1, increase the exponent of 7 by 1 and increase the exponent of 3 by 1 in 13! = 2 x 2 x 2 x 4 x 7 x 3 = 672 YES (2)
Now 19! will at the very least have a another 2 because of 19 which will take the total beyond 1000 and not in the scope of the question
So: two numbers p can take : 13 and 17
Answer - B