Difference between revisions of "1983 AIME Problems/Problem 6"
(→Solution 3 (cheap and quick)) |
T3chn0b14d3 (talk | contribs) m (→Solutions) |
||
(One intermediate revision by the same user not shown) | |||
Line 4: | Line 4: | ||
Let <math>a_n=6^{n}+8^{n}</math>. Determine the remainder upon dividing <math>a_ {83}</math> by <math>49</math>. | Let <math>a_n=6^{n}+8^{n}</math>. Determine the remainder upon dividing <math>a_ {83}</math> by <math>49</math>. | ||
− | == | + | == Solutions == |
=== Solution 1 === | === Solution 1 === | ||
Firstly, we try to find a relationship between the numbers we're provided with and <math>49</math>. We notice 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>. | Firstly, we try to find a relationship between the numbers we're provided with and <math>49</math>. We notice 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>. | ||
Line 33: | Line 33: | ||
Take <math>n=m=1,3,5,7</math> | Take <math>n=m=1,3,5,7</math> | ||
− | === Solution | + | === Solution 4=== |
<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 44: | Line 44: | ||
− | === Solution | + | === Solution 5 last resort (bash) === |
Repeat the steps of taking modulo <math>49</math> after reducing the exponents over and over again until you get a residue of <math>49,</math> namely <math>35.</math> This bashing takes a lot of time but it isn’t too bad. ~peelybonehead | Repeat the steps of taking modulo <math>49</math> after reducing the exponents over and over again until you get a residue of <math>49,</math> namely <math>35.</math> This bashing takes a lot of time but it isn’t too bad. ~peelybonehead |
Latest revision as of 15:32, 14 August 2025
Contents
Problem
Let . Determine the remainder upon dividing
by
.
Solutions
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 is equal to
-dragoon
-minor edits by flyingkinder123
Note:
This isn't true??
Take
Solution 4
Becuase , we only consider
Solution 5 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
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 |