Difference between revisions of "1989 AIME Problems/Problem 9"
Line 93: | Line 93: | ||
By CRT, <math>n\equiv 144\pmod{210}</math>, so <math>n</math> is one of <math>144, 354, ...</math>. However, <math>133^5 + 110^5 + 84^5 + 27^5 < 4\cdot 133^5 < (2\cdot 133)^5 < 354^5</math>, so <math>n < 354</math>. Thus, <math>n = \boxed{144}</math>. | By CRT, <math>n\equiv 144\pmod{210}</math>, so <math>n</math> is one of <math>144, 354, ...</math>. However, <math>133^5 + 110^5 + 84^5 + 27^5 < 4\cdot 133^5 < (2\cdot 133)^5 < 354^5</math>, so <math>n < 354</math>. Thus, <math>n = \boxed{144}</math>. | ||
+ | -brainfertilzer | ||
== See also == | == See also == | ||
{{AIME box|year=1989|num-b=8|num-a=10}} | {{AIME box|year=1989|num-b=8|num-a=10}} |
Revision as of 13:35, 16 June 2022
Contents
Problem
One of Euler's conjectures was disproved in the 1960s by three American mathematicians when they showed there was a positive integer such that Find the value of
.
Solution 1 (FLT, CRT, Inequalities)
Taking the given equation modulo and
respectively, we have
By either Fermat's Little Theorem (FLT) or inspection, we get
By either the Chinese Remainder Theorem (CRT) or inspection, we get
It is clear that so the possible values for
are
Note that
from which
If then
which arrives at a contradiction. Therefore, we conclude that
~MRENTHUSIASM
Solution 2
Note that is even, since the LHS consists of two odd and two even numbers. By Fermat's Little Theorem, we know
Hence,
Continuing, we examine the equation modulo
Thus,
is divisible by three and leaves a remainder of four when divided by
It is obvious that
so the only possibilities are
or
It quickly becomes apparent that
is much too large, so
must be
~Azjps (Solution)
~MRENTHUSIASM (Reformatting)
Solution 3
We can cheat a little bit and approximate, since we are dealing with such large numbers. As above, and it is easy to see that
Therefore,
so the last digit of
is
We notice that and
are all very close or equal to multiples of
We can rewrite
as approximately equal to
This means
must be close to
Note that will obviously be too small, so we try
and get
Bashing through the division, we find that
which is very close to
It is clear that
will not give any closer of an answer, given the rate that fifth powers grow, so we can safely assume that
is the answer.
Solution 4
In this solution we take advantage of the large numbers and utilize parity properties to give us a very good guess at the answer. The units digits of are
respectively, so the units digit of
is
This tells us
is even. Since we are dealing with enormous numbers,
should not be that far from
Note that
's units digit is
or
When to the power of
they each give
and
as the units digits. This further clues us that
ends in
Clearly, so we start with
Now we need a way of distinguishing between numbers with units digit
We can do this by finding the last three digits for each of
and
which is not that difficult. For
we have
By the same reasoning, we get
Note that
By observations,
is obviously an overestimate. So, the answer is
~jackshi2006 (Solution)
~MRENTHUSIASM (Revisions and Adjustments)
Solution 5
First, we take mod 2 on both sides to get . Mod 3 gives
. Also, mod 5 gives
(by FLT). Finally, note that mod 7 gives
. Thus,
By CRT,
, so
is one of
. However,
, so
. Thus,
.
-brainfertilzer
See also
1989 AIME (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.