Difference between revisions of "2019 AIME I Problems/Problem 9"
Toastybaker (talk | contribs) (→Solution) |
Toastybaker (talk | contribs) m (→Solution 2) |
||
Line 39: | Line 39: | ||
For <math>n</math> to have 4 divisors, it must be in the form <math>a^3</math> or <math>ab</math>, where <math>a</math> and <math>b</math> are distinct prime numbers . | For <math>n</math> to have 4 divisors, it must be in the form <math>a^3</math> or <math>ab</math>, where <math>a</math> and <math>b</math> are distinct prime numbers . | ||
For <math>n+1</math> to have 3 divisors, it must be a square number. | For <math>n+1</math> to have 3 divisors, it must be a square number. | ||
− | Let <math>n+1 = A^2</math> (A is a prime number). When <math>n = a^3, a^3+1 = A^2, (A-1)(A+1)=a^3</math>. | + | Let <math>n+1 = A^2</math> (<math>A</math> is a prime number). When <math>n = a^3, a^3+1 = A^2, (A-1)(A+1)=a^3</math>. |
We see that the only case when it works is when <math>a=2, A=3</math>, so <math>n=8</math> works. | We see that the only case when it works is when <math>a=2, A=3</math>, so <math>n=8</math> works. | ||
Line 52: | Line 52: | ||
For <math>n</math> to have 3 divisors, it must be a square number. | For <math>n</math> to have 3 divisors, it must be a square number. | ||
For <math>n+1</math> to have 4 divisors, it must be in the form <math>a^3</math> or <math>ab</math>, where <math>a</math> and <math>b</math> are distinct prime numbers. | For <math>n+1</math> to have 4 divisors, it must be in the form <math>a^3</math> or <math>ab</math>, where <math>a</math> and <math>b</math> are distinct prime numbers. | ||
− | Similar to Case 2, let <math>n = A^2</math> (A is a prime number). | + | Similar to Case 2, let <math>n = A^2</math> (<math>A</math> is a prime number). |
* When <math>n+1 = a^3, A^2+1 = a^3</math>. | * When <math>n+1 = a^3, A^2+1 = a^3</math>. | ||
Line 58: | Line 58: | ||
* When <math>n+1=ab, A^2+1 = ab</math>. | * When <math>n+1=ab, A^2+1 = ab</math>. | ||
− | We test squares of primes to find | + | We test squares of primes to find values of n that work. |
* <math>A=2</math>, <math>4+1=5</math>. Doesn't work. | * <math>A=2</math>, <math>4+1=5</math>. Doesn't work. | ||
* <math>A=3</math>, <math>9+1=10=2*5</math>. It works. <math>n=9</math> | * <math>A=3</math>, <math>9+1=10=2*5</math>. It works. <math>n=9</math> |
Revision as of 19:57, 7 November 2020
Contents
Problem 9
Let denote the number of positive integer divisors of (including and ). Find the sum of the six least positive integers that are solutions to .
Solution
In order to obtain a sum of , we must have:
- either a number with divisors (a fourth power of a prime) and a number with divisors (a prime), or
- a number with divisors (a semiprime or a cube of a prime) and a number with divisors (a square of a prime). (No integer greater than can have fewer than 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 divisors, or a fourth power like with divisors. We then find the smallest such values by hand.
- has two possibilities: and or and . Neither works.
- has two possibilities: and or and . and both work.
- has two possibilities: and or and . Only works.
- has two possibilities: and or and . Only works.
- has two possibilities: and or and . Neither works.
- has two possibilities: and or and . Neither works.
- has two possibilities: and or and . Only works.
- has two possibilities: and or and . Neither works.
- has two possibilities: and or and . Neither works.
- has two possibilities: and or and . Only 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 for the fourth power case. - mathleticguyyy
Note: Bashing would work for this problem, but it would be very tedious.
Solution 2
Let the ordered pair represent the number of divisors of and respectively. We see that to obtain a sum of , we can have and .
Case 1: When we have
For to have 2 divisors, it must be a prime number.
For to have 5 divisors, it must be in the form .
If is in the form , then . This means that , or has factors other than 1 and itself; n is not prime.
No cases work in this case
Case 2: When we have
For to have 4 divisors, it must be in the form or , where and are distinct prime numbers .
For to have 3 divisors, it must be a square number.
Let ( is a prime number). When .
We see that the only case when it works is when , so works.
Case 3: When we have
For to have 5 divisors, it must be in the form , where is a prime number.
For to have 2 divisors, it must be a prime number.
Notice that and have the same parity (even/odd). Since every prime greater than 2 are odd, must be even. Since is even, must be even as well, and the only prime number that is even is 2. When .
Case 4: When we have
For to have 3 divisors, it must be a square number.
For to have 4 divisors, it must be in the form or , where and are distinct prime numbers.
Similar to Case 2, let ( is a prime number).
- When .
There are no cases that satisfy this equation.
- When .
We test squares of primes to find values of n that work.
- , . Doesn't work.
- , . It works.
- , . It works.
- , . Doesn't work.
- , . It works.
- , . Doesn't work
- , . Doesn't work
- , . It works.
Now we add up the values of to get the answer: . ~toastybaker
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.