1983 AIME Problems/Problem 6
Let . Determine the remainder upon dividing by .
Firstly, we try to find a relationship between the numbers we're provided with and . We notice that , and both and are greater or less than by .
Thus, 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 .
- Alternatively, we could have noted that . This way, we have , and can finish the same way.
Solution 3 (cheap and quick)
As the value of is obviously we look for a pattern with others. With a bit of digging, we discover that where and are odd is equal to
Becuase , we only consider
Solution 4 last resort (bash)
Repeat the steps of taking modulo after reducing the exponents over and over again until you get a residue of namely This bashing takes a lot of time but it isn’t too bad. ~peelybonehead
Video Solution by OmegaLearn
|1983 AIME (Problems • Answer Key • Resources)|
|1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15|
|All AIME Problems and Solutions|