2016 AMC 12A Problem 18

Below is the professionally curated solution for Problem 18 of the 2016 AMC 12A, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2016 AMC 12A solutions, or check the answer key.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Concepts:factor countingprime factorization

Difficulty rating: 1910

18.

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?

110110

191191

261261

325325

425425

Solution:

Write 110n3=p1r1p2r2110n^3=p_1^{r_1}p_2^{r_2}\cdots so that the number of divisors is (r1+1)(r2+1)=110.(r_1+1)(r_2+1)\cdots=110. Since 110=2511,110=2\cdot5\cdot11, there are exactly three distinct primes, which must be 2,5,11,2,5,11, with exponents 1,4,101,4,10 in some order.

Taking r1=1,r_1=1, r2=4,r_2=4, r3=10r_3=10 for the primes 2,5,112,5,11 gives n3=215411102511=53119,son=5113. n^3=\dfrac{2^1\cdot 5^4\cdot 11^{10}}{2\cdot5\cdot11}=5^3\cdot 11^9,\quad\text{so}\quad n=5\cdot 11^3.

Then 81n4=34541112,81n^4=3^4\cdot 5^4\cdot 11^{12}, and since 3,5,113,5,11 are distinct primes, the number of divisors is (4+1)(4+1)(12+1)=5513=325. (4+1)(4+1)(12+1)=5\cdot5\cdot13=325.

Thus, the correct answer is D.

Problem 18 in Other Years