Difference between revisions of "2019 AIME I Problems/Problem 9"
Kevinmathz (talk | contribs) (→Solution) |
m (→Solution) |
||
Line 5: | Line 5: | ||
In order to obtain a sum of 7, we must have: | In order to obtain a sum of 7, we must have: | ||
* either a number with 5 divisors (''a fourth power of a prime'') and a number with 2 divisors (''a prime''), or | * either a number with 5 divisors (''a fourth power of a prime'') and a number with 2 divisors (''a prime''), or | ||
− | * a number with 4 divisors (''a semiprime'') and a number with 3 divisors (''a square of a prime''). (No integer greater than 1 can have fewer than 2 divisors.) | + | * a number with 4 divisors (''a semiprime or a cube of a prime'') and a number with 3 divisors (''a square of a prime''). (No integer greater than 1 can have fewer than 2 divisors.) |
Since both of these cases contain a number with an odd number of divisors, that number must be an even power of a prime. These can come in the form of a square like <math>3^2</math> with 3 divisors, or a fourth power like <math>2^4</math> with 5 divisors. We then find the smallest such values by hand. | Since both of these cases contain a number with an odd number of divisors, that number must be an even power of a prime. These can come in the form of a square like <math>3^2</math> with 3 divisors, or a fourth power like <math>2^4</math> with 5 divisors. We then find the smallest such values by hand. | ||
* <math>2^2</math> has two possibilities: 3 and 4, or 4 and 5. Neither works. | * <math>2^2</math> has two possibilities: 3 and 4, or 4 and 5. Neither works. |
Revision as of 14:50, 9 December 2019
Problem 9
Let denote the number of positive integer divisors of . Find the sum of the six least positive integers that are solutions to .
Solution
In order to obtain a sum of 7, we must have:
- either a number with 5 divisors (a fourth power of a prime) and a number with 2 divisors (a prime), or
- a number with 4 divisors (a semiprime or a cube of a prime) and a number with 3 divisors (a square of a prime). (No integer greater than 1 can have fewer than 2 divisors.)
Since both of these cases contain a number with an odd number of divisors, that number must be an even power of a prime. These can come in the form of a square like with 3 divisors, or a fourth power like with 5 divisors. We then find the smallest such values by hand.
- has two possibilities: 3 and 4, or 4 and 5. Neither works.
- has two possibilities: 8 and 9, or 9 and 10. (8,9) and (9,10) both work.
- has two possibilities: 15 and 16, or 16 and 17. Only (16,17) works.
- has two possibilities: 24 and 25, or 25 and 26. Only (25,26) works.
- has two possibilities: 48 and 49, or 49 and 50. Neither works.
- has two possibilities: 80 and 81, or 81 and 82. Neither works.
- has two possibilities: 120 and 121, or 121 and 122. Only (121,122) works.
- has two possibilities: 168 and 169, or 169 and 170. Neither works.
- has two possibilities: 288 and 289, or 289 and 290. Neither works.
- has two possibilities: 360 and 361, or 361 and 362. Only (361,362) works.
Having computed the working possibilities, we take the sum of the corresponding values of : . ~Kepy.
Possible improvement: since all primes are odd, their fourth powers are odd as well, which cannot be adjacent to any primes because both of the adjacent numbers will be even. Thus, we only need to check 16 for the fourth power case. - mathleticguyyy
Note: Bashing would work for this problem, but it would be very tedious.
See Also
2019 AIME I (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.