To find the number of factors of factorial n, first I tried small values of n, for factorial 2, then 3, 4, 5, 6, 7, 8, and 9. I found a generalisation for all values of n.

First find the prime factorisation of n!


n!= p1 a p2 b p3 c ...

where p1 , p2 ,... etc. are the prime factors of n! and a,b,... etc are the powers of these prime factors.

Number of divisors of n!=(a+1)(b+1)(c+1)...

To explain the confusion, I take 9! as an example. <br>
9!= 27 × 34 ×5×7

Replacing n with 9,

Number of divisors of 9!=(7+1)(4+1)(1+1)2 =8×5×4=160

Therefore, 9! has 160 divisors.

Done by: Ling Xiang Ning, Allan
School: Raffles Institution
Country: Singapore

[ Editor's note: To understand the reason for this, think of each divisor being expressed as a product of prime factors. The number of possible divisors is found by working out the number of ways of choosing the prime factors of the divisor. The prime p1 may not occur as a factor of the divisor, or it may occur to the power 1 or 2 or 3 or any power up to at most a, hence there are (a+1) possibilities for a divisor to contain p1 as a factor. Similarly there are (b+1) possibilities for a divisor to contain p2 as a factor and (c+1) possibilities for a divisor to contain p3 as a factor and so on. We multiply these numbers of possibilities to find the total number of possibilities.

The same problem exactly would arise if the classes in a school were each named by a different prime number and the number of students in class p1 is a, and there are b students in class p2 ,c students in class p3 and so on. At any time there may be no students from any of the classes in the school building or any number from any of the classes. How many different possibilities are there for the number of students in the building? Can you see that this is the same as the Factorial Fact problem? If not work out the answers in some simple cases, for example imagine 2 classes with 3 children in one and 4 children in the other.]