Skip to main content

2016 AMC 12A Problem 18

Problem 18 of 25IntermediateNumber 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 number 110n3110n^3 is divisible by the three distinct primes 2,5,11.2,5,11. If its prime exponents are r1,r2,,r_1,r_2,\ldots, then (r1+1)(r2+1)=110,(r_1+1)(r_2+1)\cdots=110, where 110=2511.110=2\cdot5\cdot11. Because there are already at least three factors greater than 1,1, there are exactly three, so no other prime divides n.n. Each exponent in 110n3110n^3 is 1(mod3),1\pmod3, so each divisor-count factor ri+1r_i+1 is 2(mod3).2\pmod3. The factors 2,5,112,5,11 all have that form, so the exponents are 1,4,101,4,10 in some order. After subtracting the exponent 11 from 110110 and dividing by 3,3, the exponents in nn are 0,1,30,1,3 in some order. Thus n=pq3n=pq^3 for two distinct primes p,qp,q chosen from 2,5,11.2,5,11. Consequently n4n^4 has exponents 44 and 12,12, while 81=3481=3^4 introduces a third prime because nn is not divisible by 3.3. Hence the number of divisors of 81n481n^4 is (4+1)(4+1)(12+1)=5513=325. \begin{gathered} (4+1)(4+1)(12+1)\\ =5\cdot5\cdot13\\ =325. \end{gathered} 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.