Difference between revisions of "2020 AMC 10B Problems/Problem 25"
(→Solution) |
Kevinmathz (talk | contribs) (→Solution) |
||
Line 6: | Line 6: | ||
==Solution== | ==Solution== | ||
− | + | ||
+ | Note that <math>96 = 2^5 \cdot 3</math>. Since there are at most six not nexxessarily distinct factors <math>>1</math> multiplying to <math>96</math>, we have six cases: <math>k=1, 2, ..., 6.</math> | ||
+ | |||
+ | <math>k=1</math>: We see that there is <math>1</math> way, merely <math>96</math>. | ||
+ | <math>k=2</math>: This way, we have the <math>3</math> in one slot and <math>2</math> in another, and symmetry. The four other <math>2</math>'s leave us with <math>5</math> ways and symmetry doubles us so we have <math>10</math>. | ||
+ | <math>k=3</math>: We have <math>3, 2, 2</math> as our baseline. We need to multiply by <math>2</math> in <math>3</math> places, and see that we can split the remaining three powers of 2 in a manner that is 3-0-0, 2-1-0 or 1-1-1. A 3-0-0 split has <math>6 + 3 = 9</math> ways of happening (24-2-2 and symmetry; 2-3-16 and symmetry), a 2-1-0 split has <math>6 \cdot 3 = 18</math> ways of happening (due to all being distinct) and a 1-1-1 split has <math>3</math> ways of happening (6-4-4 and symmetry) so in this case we have <math>9+18+3=30</math> ways. | ||
+ | <math>k=4</math>: We have <math>3, 2, 2, 2</math> as our baseline, and for the two other <math>2</math>'s, we have a 2-0-0-0 or 1-1-0-0 split. The former grants us <math>4+12=16</math> ways (12-2-2-2 and symmetry and 3-8-2-2 and symmetry) and the latter grants us also <math>12+12=24</math> ways (6-4-2-2 and symmetry and 3-4-4-2 and symmetry) for a total of <math>16+24=40</math> ways. | ||
+ | <math>k=5</math>: We have <math>3, 2, 2, 2, 2</math> as our baseline and one place to put the last two: on another two or on the three. On the three gives us <math>5</math> ways due to symmetry and on another two gives us <math>5 \cdot 4 = 20</math> ways due to symmetry. Thus, we have <math>5+20=25</math> ways. | ||
+ | <math>k=6</math>: We have <math>3, 2, 2, 2, 2, 2</math> and symmetry and no more twos to multiply, so by symmetry, we have <math>6</math> ways. | ||
+ | |||
+ | Thus, adding, we have <math>1+10+30+40+25+6=\textbf{(A) } 112</math>. | ||
+ | |||
+ | ~kevinmathz | ||
==See Also== | ==See Also== |
Revision as of 22:36, 7 February 2020
Problem
Let denote the number of ways of writing the positive integer as a productwhere , the are integers strictly greater than , 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 can be written as , , and , so . What is ?
Solution
Note that . Since there are at most six not nexxessarily distinct factors multiplying to , we have six cases:
: We see that there is way, merely . : This way, we have the in one slot and in another, and symmetry. The four other 's leave us with ways and symmetry doubles us so we have . : We have as our baseline. We need to multiply by in places, and see that we can split the remaining three powers of 2 in a manner that is 3-0-0, 2-1-0 or 1-1-1. A 3-0-0 split has ways of happening (24-2-2 and symmetry; 2-3-16 and symmetry), a 2-1-0 split has ways of happening (due to all being distinct) and a 1-1-1 split has ways of happening (6-4-4 and symmetry) so in this case we have ways. : We have as our baseline, and for the two other 's, we have a 2-0-0-0 or 1-1-0-0 split. The former grants us ways (12-2-2-2 and symmetry and 3-8-2-2 and symmetry) and the latter grants us also ways (6-4-2-2 and symmetry and 3-4-4-2 and symmetry) for a total of ways. : We have as our baseline and one place to put the last two: on another two or on the three. On the three gives us ways due to symmetry and on another two gives us ways due to symmetry. Thus, we have ways. : We have and symmetry and no more twos to multiply, so by symmetry, we have ways.
Thus, adding, we have .
~kevinmathz
See Also
2020 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 24 |
Followed by Last Problem | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
All AMC 10 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.