Difference between revisions of "2020 AMC 10B Problems/Problem 25"
(Created page with "==Problem== 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...") |
(→Solution) |
||
Line 6: | Line 6: | ||
==Solution== | ==Solution== | ||
+ | Use casework | ||
==See Also== | ==See Also== |
Revision as of 20:11, 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
Use casework
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.