2020 AMC 12B Problem 24

Attempt Problem 24 of the 2020 AMC 12B below, then check your answer against the professionally curated solution from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2020 AMC 12B solutions, or check the answer key.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

24.

Let D(n)D(n) denote the number of ways of writing the positive integer nn as a product n=f1⋅f2⋯fk,n = f_1\cdot f_2\cdots f_k, where k≥1,k\ge1, the fif_i are integers strictly greater than 1,1, and the order in which the factors are listed matters (that is, two representations that differ only in the order of the factors are counted as distinct). For example, the number 66 can be written as 6,6, 2⋅3,2\cdot 3, and 3⋅2,3\cdot2, so D(6)=3.D(6) = 3. What is D(96)?D(96)?
112112
128128
144144
172172
184184
Answer: A
Concepts:prime factorizationcombinationsrecursive countingfactor
Small hint:
Write 96=25⋅396=2^5\cdot 3
Big hint:
For a product with kk factors, choose which factor contains the single 33 and distribute the five factors of 22
Solution:
Write 96=25⋅3.96=2^5\cdot3. Suppose an ordered factorization has kk factors. Exactly one factor contains the single prime factor 33; choose its position in kk ways.
The other k−1k-1 factors must each contain at least one factor of 2,2, while the factor containing 33 may contain any number of factors of 2.2. Distributing the five factors of 22 under these conditions can be done in (5k−1)\binom{5}{k-1} ways. Therefore the number of ordered factorizations with kk factors is k(5k−1),k\binom{5}{k-1}, where 1≤k≤6.1\le k\le6.
Thus D(96)=∑k=16k(5k−1).D(96)=\sum_{k=1}^6 k\binom{5}{k-1}. Letting j=k−1,j=k-1, this becomes ∑j=05(j+1)(5j)=∑j=05j(5j)+∑j=05(5j)=5⋅24+25=80+32=112. \begin{aligned} &\sum_{j=0}^5 (j+1)\binom5j \\ &\quad =\sum_{j=0}^5 j\binom5j+\sum_{j=0}^5\binom5j \\ &\quad =5\cdot2^4+2^5 \\ &\quad =80+32=112. \end{aligned}
Thus, A is the correct answer.
LIVE by Po-Shen Loh
Programs

LIVE Classes

Self-Paced Classes

Stars

Scholarship

About Us

Who Is Po-Shen Loh?

Email Contact

Newsletter

Jobs

Become a Star

For a more Thought Full world.

© 2026 Expii, Inc.Terms of UsePrivacy PolicyCOPPA Privacy Policy