Difference between revisions of "1983 AIME Problems/Problem 6"
m |
|||
Line 5: | Line 5: | ||
== Solution == | == Solution == | ||
=== Solution 1 === | === Solution 1 === | ||
− | First, we try to find a relationship between the numbers we're provided with and <math>49</math>. We realize that <math>49=7^2</math> and both <math>6</math> and <math>8</math> greater or less than <math>7</math> by <math>1</math>. | + | First, we try to find a relationship between the numbers we're provided with and <math>49</math>. We realize that <math>49=7^2</math> and both <math>6</math> and <math>8</math> are greater or less than <math>7</math> by <math>1</math>. |
Expressing the numbers in terms of <math>7</math>, we get <math>(7-1)^{83}+(7+1)^{83}</math>. | Expressing the numbers in terms of <math>7</math>, we get <math>(7-1)^{83}+(7+1)^{83}</math>. |
Revision as of 09:56, 2 September 2013
Problem
Let equal . Determine the remainder upon dividing by .
Contents
[hide]Solution
Solution 1
First, we try to find a relationship between the numbers we're provided with and . We realize that and both and are greater or less than by .
Expressing the numbers in terms of , we get .
Applying the Binomial Theorem, half of our terms cancel out and we are left with . We realize that all of these terms are divisible by except the final term.
After some quick division, our answer is .
Solution 2
Since (the Euler's totient function), by Euler's Totient Theorem, where . Thus .
See Also
1983 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 5 |
Followed by Problem 7 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |