Find the number of perfect square divisors of 1 2 ! .
Clarification:
It is 12 factorial. That is,
1
2
×
1
1
×
1
0
×
…
×
2
×
1
.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
that was the way i did it
I lost 1 and so had 35 as the sum. Initially I had 1 in my count !
The prime factorization of 12! is 2 1 0 X 3 5 X 5 2 X 7 1 X 1 1 1 .
We can write the former equation as:
( 4 5 X 9 2 X 3 1 X 2 5 1 X 7 1 X 1 1 1 ) .
Thus, convert the prime factors powers into square number powers.
Now, no. of Square divisors will be (5+1) X (2+1 ) X (1+1)
(add 1 to the powers of each divisors)
Therefore total no. of factors are 6 X 3 X 2 = 3 6
Problem Loading...
Note Loading...
Set Loading...
The prime factorization of 1 2 ! is 2 1 0 ∗ 3 5 ∗ 5 2 ∗ 7 ∗ 1 1 .
Thus any perfect square divisor will be of the form 2 a ∗ 3 b ∗ 5 c , with
6 choices for a , (namely 0 , 2 , 4 , 6 , 8 , 1 0 ),
3 choices for b , (namely 0 , 2 , 4 ), and
2 choices for c , (namely 0 , 2 ).
Thus by the product rule 1 2 ! has a total of 6 ∗ 3 ∗ 2 = 3 6 perfect square divisors.