Difference between revisions of "2019 AIME II Problems/Problem 12"
(Created blank page) |
Scrabbler94 (talk | contribs) (add problem) |
||
| Line 1: | Line 1: | ||
| + | ==Problem== | ||
| + | For <math>n \ge 1</math> call a finite sequence <math>(a_1, a_2 \ldots a_n)</math> of positive integers progressive if <math>a_i < a_{i+1}</math> and <math>a_i</math> divides <math>a_{i+1}</math> for all <math>1 \le i \le n-1</math>. Find the number of progressive sequences such that the sum of the terms in the sequence is equal to <math>360</math>. | ||
| + | ==Solution== | ||
| + | |||
| + | ==See Also== | ||
| + | {{AIME box|year=2019|n=II|num-b=11|num-a=13}} | ||
| + | {{MAA Notice}} | ||
Revision as of 16:17, 22 March 2019
Problem
For 
call a finite sequence 
of positive integers progressive if 
and 
divides 
for all 
. Find the number of progressive sequences such that the sum of the terms in the sequence is equal to 
.
Solution
See Also
| 2019 AIME II (Problems • Answer Key • Resources) | ||
| Preceded by Problem 11 |
Followed by Problem 13 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
