Difference between revisions of "2003 AMC 12A Problems/Problem 23"
Epicfailiure (talk | contribs) (→Solution) |
(→Problem) |
||
| Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
| + | |||
| + | How many perfect squares are divisors of the product <math>1! \cdot 2! \cdot 3! \cdot \hdots \cdot 9!</math>? | ||
| + | |||
| + | <math> \textbf{(A)}\ 504\qquad\textbf{(B)}\ 672\qquad\textbf{(C)}\ 864\qquad\textbf{(D)}\ 936\qquad\textbf{(E)}\ 1008 </math> | ||
==Solution== | ==Solution== | ||
Revision as of 21:17, 1 January 2012
Problem
How many perfect squares are divisors of the product 
?
Solution
We want to find the number of perfect square factors in the product of all the factorials of numbers from 1 - 9. We can write this out and take out the factorials, and then find a prime factorization of the entire product. We can also find this prime factorization by finding the number of times each factor is repeated in each factorial. Anyway, this comes out to be equal to 2^30 * 3^13 * 5^5 * 7^3. To find the amount of perfect square factors, we realize that each exponent in the prime factorization must be even. This gives us 16*7*3*2 = 672 (B).
See Also
| 2003 AMC 12A (Problems • Answer Key • Resources) | |
| Preceded by Problem 22 |
Followed by Problem 24 |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
| All AMC 12 Problems and Solutions | |
