Difference between revisions of "2003 AMC 12A Problems/Problem 23"

Revision as of 09:18, 4 July 2013

Problem

How many perfect squares are divisors of the product $1! \cdot 2! \cdot 3! \cdot \hdots \cdot 9!$ ?

$\textbf{(A)}\ 504\qquad\textbf{(B)}\ 672\qquad\textbf{(C)}\ 864\qquad\textbf{(D)}\ 936\qquad\textbf{(E)}\ 1008$

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. 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: $2^{15}$ $*$ $3^{6}$ $*$ $5^2$ $*$ $7^1$ . To find the total number of possibilities, we add $1$ to each exponent and multiply them all together. This gives us $16*7*3*2$ $=$ $672$ $\Rightarrow\boxed{\mathrm{(B)}}$ .

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

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.

@@ Line 1: / Line 1: @@
 ==Problem==
@@ Line 14: / Line 13: @@
 [[Category:Intermediate Algebra Problems]]
+{{MAA Notice}}

Page

Toolbox

Search

Difference between revisions of "2003 AMC 12A Problems/Problem 23"

Revision as of 09:18, 4 July 2013

Problem

Solution

See Also