Skip to main content

2016 AMC 10A Problem 22

Problem 22 of 25HarderNumber Theory

For some positive integer n,n, the number 110n3110n^3 has 110110 positive integer divisors, including 11 and the number 110n3.110n^3. How many positive integer divisors does the number 81n481n^4 have?

Answer choices

Show solution

Solution

The prime factorization is 110=2511110=2\cdot5\cdot11. If 110n3110n^3 has 110=2511110=2\cdot5\cdot11 divisors, then it has exactly three prime factors, with exponents 1,4,101,4,10 in some order. For each of the primes 2,5,112,5,11, its exponent in 110n3110n^3 is 11 more than a multiple of 33. The exponents 1,4,101,4,10 all have this form, so the corresponding exponents in nn are 0,1,30,1,3 in some order. In 81n4=34n481n^4=3^4n^4, the exponents from n4n^4 are therefore 0,4,120,4,12, in some order, along with the exponent 44 on prime 33. Hence the divisor count is (0+1)(4+1)(12+1)(4+1)=325. \begin{aligned} &(0+1)\cdot(4+1)\cdot(12+1) \\ &\quad {}\cdot(4+1)=325. \end{aligned} Thus, the correct answer is D.

More practice

Concepts: factor counting · prime factorization

Problem text and solution from the LIVE past-contest archive. See also the AoPS wiki page for community solutions.