To find the number of factors of factorial n, first I tried small values of
,
for factorial 2, then 3, 4, 5, 6, 7, 8, and 9. I found a generalisation
for all values of
.
First find the prime factorisation of
where
etc. are the prime factors of
and
etc
are the powers of these prime factors.
Number of divisors of
To explain the confusion, I take
as an example. <br>
Replacing
with 9,
Number of divisors of
Therefore,
has
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
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
possibilities for a divisor to contain
as a factor. Similarly
there are
possibilities for a divisor to contain
as a factor and
possibilities for
a divisor to contain
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
is a,
and there are
students in class
students in class
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.]