|
|
| (13 intermediate revisions by 6 users not shown) |
| Line 1: |
Line 1: |
| − | Let <math>D(n)</math> denote the number of ways of writing the positive integer <math>n</math> as a product<cmath>n = f_1\cdot f_2\cdots f_k,</cmath>where <math>k\ge1</math>, the <math>f_i</math> are integers strictly greater than <math>1</math>, 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 <math>6</math> can be written as <math>6</math>, <math>2\cdot 3</math>, and <math>3\cdot2</math>, so <math>D(6) = 3</math>. What is <math>D(96)</math>?
| + | #REDIRECT [[2020 AMC 10B Problems/Problem 25]] |
| − | | |
| − | <math>\textbf{(A) } 112 \qquad\textbf{(B) } 128 \qquad\textbf{(C) } 144 \qquad\textbf{(D) } 172 \qquad\textbf{(E) } 184</math>
| |
| − | | |
| − | ==Solution==
| |
| − | none as of yet...
| |
| − | | |
| − | {{AMC12 box|year=2020|ab=B|num-b=23|num-a=25}}
| |
| − | {{MAA Notice}}
| |
