Difference between revisions of "2019 AIME II Problems/Problem 9"
The jake314 (talk | contribs) (→Solution 2) |
(→Solution) |
||
Line 7: | Line 7: | ||
If <math>a+1 = 4</math>, then <math>b+1 = 5</math>. But this leads to no solutions, as <math>(a,b) = (3,4)</math> gives <math>2^3 5^4 > 2019</math>. | If <math>a+1 = 4</math>, then <math>b+1 = 5</math>. But this leads to no solutions, as <math>(a,b) = (3,4)</math> gives <math>2^3 5^4 > 2019</math>. | ||
− | If <math>a+1 = 5</math>, then <math>b+1 = 2</math> or <math>4</math>. The first case gives <math>n = 2^4 \cdot 5^1 \cdot p</math> where <math>p</math> is a prime other than 2 or 5. Thus we have <math>80p < 2019 \implies p = 3, 7, 11, 13, 17, 19, 23</math>. The sum of all such <math>n</math> is <math>80(3+7+11+13+17+19+23) = | + | If <math>a+1 = 5</math>, then <math>b+1 = 2</math> or <math>4</math>. The first case gives <math>n = 2^4 \cdot 5^1 \cdot p</math> where <math>p</math> is a prime other than 2 or 5. Thus we have <math>80p < 2019 \implies p = 3, 7, 11, 13, 17, 19, 23</math>. The sum of all such <math>n</math> is <math>80(3+7+11+13+17+19+23) = 7440</math>. In the second case <math>b+1 = 4</math> and <math>d(k) = 1</math>, and there is one solution <math>n = 2^4 \cdot 5^3 = 2000</math>. |
If <math>a+1 = 10</math>, then <math>b+1 = 2</math>, but this gives <math>2^9 \cdot 5^1 > 2019</math>. No other values for <math>a+1</math> work. | If <math>a+1 = 10</math>, then <math>b+1 = 2</math>, but this gives <math>2^9 \cdot 5^1 > 2019</math>. No other values for <math>a+1</math> work. |
Revision as of 16:53, 7 March 2020
Contents
Problem 9
Call a positive integer -pretty if has exactly positive divisors and is divisible by . For example, is -pretty. Let be the sum of positive integers less than that are -pretty. Find .
Solution
Every 20-pretty integer can be written in form , where , , , and , where is the number of divisors of . Thus, we have , using the fact that the divisor function is multiplicative. As must be a divisor of 20, there are not many cases to check.
If , then . But this leads to no solutions, as gives .
If , then or . The first case gives where is a prime other than 2 or 5. Thus we have . The sum of all such is . In the second case and , and there is one solution .
If , then , but this gives . No other values for work.
Then we have .
-scrabbler94
Solution 2
For to be 20-pretty, can only take on certain prime factorization forms: namely, . Notice that for the first form, the smallest possible integer with it is and the smallest integer with the second form divisible by 20 is which are both greater than 2019.
For the third form, the only numbers with it and divisible by 20 is and so only is 20-pretty with this factorization.
For the fourth form, is the sufficient combination for . Since , . Therefore, can take on or .
Thus, .
See Also
2019 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 8 |
Followed by Problem 10 | |
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.