Difference between revisions of "1999 AMC 8 Problems/Problem 24"
m (→Solution 1) |
Oliverhsiao (talk | contribs) m (→Solution 2) |
||
| Line 11: | Line 11: | ||
==Solution 2== | ==Solution 2== | ||
| − | Write <math>1999</math> as <math>2000-1</math>. We are taking <math>(2000-1)^{2000} \mod{10}</math>. Using the binomial theorem, we see that ALL terms in this expansion are divisible by <math>2000</math> except for the very last term, which is just <math>(-1)^{2000}</math>. This is clear because the binomial expansion is just choosing how many <math>2000</math>s and how many <math>-1</math>s there are for each term. Using this, we can take the entire polynomial <math>\mod{10}</math>, which leaves just <math>(-1)^{2000}=\boxed{\text{(B)}\ 1}</math>. | + | Write <math>1999</math> as <math>2000-1</math>. We are taking <math>(2000-1)^{2000} \mod{10}</math>. Using the binomial theorem, we see that ALL terms in this expansion are divisible by <math>2000</math>, which is in turn divisible by <math>5</math>, except for the very last term, which is just <math>(-1)^{2000}</math>. This is clear because the binomial expansion is just choosing how many <math>2000</math>s and how many <math>-1</math>s there are for each term. Using this, we can take the entire polynomial <math>\mod{10}</math>, which leaves just <math>(-1)^{2000}=\boxed{\text{(B)}\ 1}</math>. |
==Solution 3== | ==Solution 3== | ||
Revision as of 22:56, 23 August 2024
Contents
Problem
When 
is divided by 
, the remainder is
Solution 1
Note that the units digits of the powers of 9 have a pattern: 
, 
, 
, 
, and so on. Since all natural numbers with the same last digit have the same remainder when divided by 5, the entire number doesn't matter, just the last digit. For even powers of 
, the number ends in a 
. Since the exponent is even, the final digit is . Note that all natural numbers that end in have a remainder of when divided by . So, our answer is 
.
Solution 2
Write 
as 
. We are taking 
. Using the binomial theorem, we see that ALL terms in this expansion are divisible by 
, which is in turn divisible by , except for the very last term, which is just 
. This is clear because the binomial expansion is just choosing how many s and how many 
s there are for each term. Using this, we can take the entire polynomial 
, which leaves just 
.
Solution 3
As 
, we have 
. Thus, the answer is .
Solution 4
A sum/product of any two natural numbers has the same remainder, when divided by $n \in \{\mathbb N}$ (Error compiling LaTeX. Unknown error_msg), as the sum/product of their remainders. Thus, we can use the basic definition of an exponent and view the problem as 
.
Using the fact stated in the first sentence, we see that the remainder of , when divided by , is 
. The problem can now be written viewed as finding the remainder of 
when it is divided by , which is already much simpler.
Now, toying with the simplified problem a little, see notice that powers of alternate from ending in and 
. We notice that even powers of always end in , and also that is even. Thus must end in , which, when divided by gives a remainder of .
Video Solution by Soo
https://youtu.be/jCHiQMK7k3w - Soo, DRMS, NM
Video Solution by CosineMethod [🔥Fast and Easy🔥]
https://www.youtube.com/watch?v=U_WOZpd7eYQ
See Also
| 1999 AMC 8 (Problems • Answer Key • Resources) | ||
| Preceded by Problem 23 |
Followed by Problem 25 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
| All AJHSME/AMC 8 Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
