Difference between revisions of "2015 AIME I Problems/Problem 3"
Countmath1 (talk | contribs) (→Solution 8 (Pattern Recognition)) |
Countmath1 (talk | contribs) (→Solution 9 (Slightly Different Modular Arithmetic)) |
||
Line 103: | Line 103: | ||
We see that <math>16p+1=n^3</math> for a positive integer <math>n</math>. Subtracting <math>1</math>, we can turn this equation into a modular congruence, since <math>n^3-1</math> must be a multiple of <math>16</math>. | We see that <math>16p+1=n^3</math> for a positive integer <math>n</math>. Subtracting <math>1</math>, we can turn this equation into a modular congruence, since <math>n^3-1</math> must be a multiple of <math>16</math>. | ||
− | Since <math>n^3-1\equiv0\pmod{16}</math>, <math>n^3\equiv1\pmod{16}</math>. We observe that <math>n=1</math> is a solution to this congruence, which doesn't work. The next, or most obvious | + | Since <math>n^3-1\equiv0\pmod{16}</math>, <math>n^3\equiv1\pmod{16}</math>. We observe that <math>n=1</math> is a solution to this congruence, which doesn't work. The next, or most obvious number to try is <math>n=17</math>. Plugging this in to our original equation, we get |
<math>17^3=16p+1</math>, yielding <math>p=\boxed{307}</math>, which is prime. | <math>17^3=16p+1</math>, yielding <math>p=\boxed{307}</math>, which is prime. |
Revision as of 10:03, 17 May 2022
Contents
Problem
There is a prime number such that
is the cube of a positive integer. Find
.
Video Solution
https://youtu.be/3bRjcrkd5mQ?t=1096
~ pi_is_3.14
Solution 1
Let the positive integer mentioned be , so that
. Note that
must be odd, because
is odd.
Rearrange this expression and factor the left side (this factoring can be done using or synthetic divison once it is realized that
is a root):
Because is odd,
is even and
is odd. If
is odd,
must be some multiple of
. However, for
to be any multiple of
other than
would mean
is not a prime. Therefore,
and
.
Then our other factor, , is the prime
:
Solution 2 (Similar to 1)
Observe that this is the same as for some integer
.
So:
Observe that either or
because
and
share no factors (
can't be
).
Let
.
Then:
Which is impossible for integer n. So and
- firebolt360
Solution 3
Since is odd, let
. Therefore,
. From this, we get
. We know
is a prime number and it is not an even number. Since
is an odd number, we know that
.
Therefore, .
Solution 4
Let . Realize that
congruent to
, so let
. Expansion, then division by 4, gets
. Clearly
for some
. Substitution and another division by 4 gets
. Since
is prime and there is a factor of
in the LHS,
. Therefore,
.
Solution 5
Notice that must be in the form
. Thus
, or
. Since
must be prime, we either have
or
. Upon further inspection and/or using the quadratic formula, we can deduce
. Thus we have
, and
.
Solution 6
Notice that the cube 16p+1 is equal to is congruent to 1 mod 16. The only cubic numbers that leave a residue of 1 mod 16 are 1 and 15. Case one: The cube is of the form 16k+1-->Plugging this in, and taking note that p is prime and has only 1 factor gives p=307 Case two: The cube is of the form 16k+15--> Plugging this in, we quickly realize that this case is invalid, as that implies p is even, and p=2 doesn't work here
Hence, is our only answer
pi_is_3.141
Solution 7
If , we have
, so
. If
we have
, which is not prime. If
we have
, or
Solution 8 (Pattern Recognition)
Notice that:
Here, we can see a clear pattern that , where
is some positive (not necessarily prime) integer. Hence, the equation
can interpret as
. Solving it, we got
. After checking all possible divisors, we will find that
is prime. Hence, we got
.
Solution 9 (Slightly Different Modular Arithmetic)
We see that for a positive integer
. Subtracting
, we can turn this equation into a modular congruence, since
must be a multiple of
.
Since ,
. We observe that
is a solution to this congruence, which doesn't work. The next, or most obvious number to try is
. Plugging this in to our original equation, we get
, yielding
, which is prime.
See also
2015 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 2 |
Followed by Problem 4 | |
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.