Difference between revisions of "1989 AIME Problems/Problem 9"
PI-Dimension (talk | contribs) m (→Solution) |
|||
Line 8: | Line 8: | ||
Continuing, we examine the equation modulo 3, | Continuing, we examine the equation modulo 3, | ||
− | <center><math>- | + | <center><math>1 - 1 + 0 + 0 \equiv n\pmod{3}</math></center> |
<center><math>0 \equiv n\pmod{3}</math></center> | <center><math>0 \equiv n\pmod{3}</math></center> | ||
Revision as of 14:52, 4 November 2012
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
Note that is even, since the consists of two odd and two even numbers. By Fermat's Little Theorem, we know is congruent to modulo 5. Hence,
Continuing, we examine the equation modulo 3,
Thus, is divisible by three and leaves a remainder of four when divided by 5. It's obvious that , so the only possibilities are or . It quickly becomes apparent that 174 is much too large, so must be .
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 |