Difference between revisions of "1999 AMC 8 Problems/Problem 24"
(→Solution) |
|||
| Line 12: | Line 12: | ||
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{(D)}\ 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> 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{(D)}\ 1}</math>. | ||
| + | |||
| + | ==Solution 3== | ||
| + | As <math>1999 \equiv -1 \pmod{5}</math>, we have <math>1999^{2000} \equiv (-1)^{2000} \equiv 1 \pmod{5}</math>. Thus, the answer is <math>\boxed{\text{(D)}\ 1}</math>. | ||
==See Also== | ==See Also== | ||
{{AMC8 box|year=1999|num-b=23|num-a=25}} | {{AMC8 box|year=1999|num-b=23|num-a=25}} | ||
{{MAA Notice}} | {{MAA Notice}} | ||
Revision as of 12:19, 27 September 2015
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 
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 .
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. 
