Difference between revisions of "1983 AIME Problems/Problem 6"
(→Solution 3 (cheap and quick)) |
Pi is 3.14 (talk | contribs) (→Solution 3) |
||
Line 26: | Line 26: | ||
-dragoon | -dragoon | ||
− | == Solution 3== | + | === Solution 3=== |
<math>6^{83} + 8^{83} = (6+8)(6^{82}-6^{81}8+\ldots-8^{81}6+8^{82})</math> | <math>6^{83} + 8^{83} = (6+8)(6^{82}-6^{81}8+\ldots-8^{81}6+8^{82})</math> | ||
Line 34: | Line 34: | ||
<math>6^{83} + 8^{83} \equiv 14 \cdot 6 \equiv \boxed{035} \pmod{49}</math> | <math>6^{83} + 8^{83} \equiv 14 \cdot 6 \equiv \boxed{035} \pmod{49}</math> | ||
+ | |||
+ | == Video Solution by OmegaLearn == | ||
+ | https://youtu.be/-H4n-QplQew?t=792 | ||
+ | |||
+ | ~ pi_is_3.14 | ||
== See Also == | == See Also == |
Revision as of 07:39, 4 November 2022
Problem
Let . Determine the remainder upon dividing by .
Contents
Solution
Solution 1
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 .
Solution 2
Since (see Euler's totient function), Euler's Totient Theorem tells us that where . Thus .
- 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, when divided by it has a remainder of (I don’t know how to do modular arithmetic in )
-dragoon
Solution 3
Becuase , we only consider
Video Solution by OmegaLearn
https://youtu.be/-H4n-QplQew?t=792
~ pi_is_3.14
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 |