AMC 10 · 2005 · #15

Grade 8 arithmetic
prime-factorizationdivisor-countfactorial identify-subproblemssystematic-enumeration ↑ Prerequisites: prime-factorizationfactorialdivisor-count
📏 Medium solution 💡 2 insights
Problem
The number 3! · 5! · 7! is a product of three factorials, and a perfect cube means a whole number of the form n · n · n. How many positive perfect cubes divide it with no remainder?

Pick an answer.

(A)
2
(B)
3
(C)
4
(D)
5
(E)
6

AMC 10 2005 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.

How to solve
Strategy Identify Subproblems

A cube divisor is decided one prime at a time, so Tool #7 splits the hard question into four easy ones: for each prime 2, 3, 5, 7, how many cube-legal exponents fit under the cap set by the big number? First rewrite 3! · 5! · 7! as one prime factorization 2⁸ · 3⁴ · 5² · 7¹. Tool #5 supplies the key pattern: a divisor is a cube exactly when each exponent is a multiple of 3. Tool #2 then lists the legal exponents for each prime (0, 3, 6, … up to the cap), and the count of whole combinations is just the product of the four separate counts.

1STEP 1

Factor each factorial into primes

Break each factorial into prime factors: 3! = 6, 5! = 120, 7! = 5040.

3! = 2 · 3, 5! = 2³ · 3 · 5, 7! = 2⁴ · 3² · 5 · 7
2STEP 2

Combine into one prime factorization

Add the exponents of each shared prime: the 2's give 2¹⁺³⁺⁴, the 3's give 3¹⁺¹⁺², the 5's give 5⁰⁺¹⁺¹, and 7 appears once.

3! · 5! · 7! = 2⁸ · 3⁴ · 5² · 7¹
3STEP 3

Say what makes a divisor a cube

Any divisor is 2^a·3^b·5^c·7^d with a ≤ 8, b ≤ 4, c ≤ 2, d ≤ 1, and it is a cube exactly when all four exponents are multiples of 3.

2^a 3^b 5^c 7^d is a cube ⇔ a, b, c, d are multiples of 3
4STEP 4

Count cube-legal exponents per prime

Under each cap list the multiples of 3, including 0: 2 gives 0, 3, 6; 3 gives 0, 3; 5 and 7 give only 0.

a ∈ {0,3,6}, b ∈ {0,3}, c ∈ {0}, d ∈ {0} → 3, 2, 1, 1 choices
5STEP 5

Multiply the choices together

The four exponents are chosen independently, so multiply the separate counts: 3 × 2 × 1 × 1.

3 × 2 × 1 × 1 = 6 → (E)
Answer
6
The six cubes can be listed explicitly to confirm the count: taking a ∈ {0,3,6} and b ∈ {0,3} (with c = d = 0) gives 1, 2³, 2⁶, 3³, 2³ 3³, 2⁶ 3³ — exactly six perfect cubes, each dividing 2⁸ · 3⁴ · 5² · 7. Primes 5 and 7 contribute nothing extra because their exponents (2 and 1) cannot reach 3, which correctly rules out any cube using 5 or 7. The count 6 matches choice (E).
💡Key takeaway

To count cube divisors, prime-factorize the number, then for each prime count how many multiples of 3 (including 0) fit under its exponent — and multiply those counts.

  • Factor each factorial into primes
  • Combine into one prime factorization
  • Say what makes a divisor a cube
  • Count cube-legal exponents per prime
  • Multiply the choices together