Difference between revisions of "2010 AMC 12A Problems/Problem 23"
m (→Solution 2) |
m (→Solution) |
||
Line 12: | Line 12: | ||
There might be a problem when you cancel out the 10s from <math>90!</math>. One method is to cancel out a factor of 2 from an existing number along with a factor of 5. But this might prove cumbersome, as the grouping method will not be as effective. Instead, take advantage of ''inverses'' in modular arithmetic. Just leave the negative powers of 2 in a "storage base," and take care of the other terms first. Then, use Fermat's Little Theorem to solve for the power of 2. | There might be a problem when you cancel out the 10s from <math>90!</math>. One method is to cancel out a factor of 2 from an existing number along with a factor of 5. But this might prove cumbersome, as the grouping method will not be as effective. Instead, take advantage of ''inverses'' in modular arithmetic. Just leave the negative powers of 2 in a "storage base," and take care of the other terms first. Then, use Fermat's Little Theorem to solve for the power of 2. | ||
− | == Solution == | + | == Solution 1== |
We will use the fact that for any integer <math>n</math>, | We will use the fact that for any integer <math>n</math>, |
Revision as of 21:14, 26 April 2020
Problem
The number obtained from the last two nonzero digits of is equal to . What is ?
Hints and Method of Attack
Let be the result of dividing by tens such that is not divisible by 10. We want to consider . But because 100 is not prime, and because is obviously divisible by 4 (if in doubt, look at the answer choices), we only need to consider .
However, 25 is a very particular number. , and so is . How can we group terms to take advantage of this fact?
There might be a problem when you cancel out the 10s from . One method is to cancel out a factor of 2 from an existing number along with a factor of 5. But this might prove cumbersome, as the grouping method will not be as effective. Instead, take advantage of inverses in modular arithmetic. Just leave the negative powers of 2 in a "storage base," and take care of the other terms first. Then, use Fermat's Little Theorem to solve for the power of 2.
Solution 1
We will use the fact that for any integer ,
First, we find that the number of factors of in is equal to . Let . The we want is therefore the last two digits of , or . If instead we find , we know that , what we are looking for, could be , , , or . Only one of these numbers will be a multiple of four, and whichever one that is will be the answer, because has to be a multiple of 4.
If we divide by by taking out all the factors of in , we can write as where where every multiple of 5 is replaced by the number with all its factors of 5 removed. Specifically, every number in the form is replaced by , and every number in the form is replaced by .
The number can be grouped as follows:
Where the first line is composed of the numbers in that aren't multiples of five, the second line is the multiples of five and not 25 after they have been divided by five, and the third line is multiples of 25 after they have been divided by 25.
Using the identity at the beginning of the solution, we can reduce to
Using the fact that (or simply the fact that if you have your powers of 2 memorized), we can deduce that . Therefore .
Finally, combining with the fact that yields .
Solution 2
Let be after we truncate its zeros. Notice that has exactly (floored) factors of 5; thus, We shall consider modulo 4 and 25, to determine its residue modulo 100. It is easy to prove that is divisible by 4 (consider the number of 2s dividing minus the number of 5s dividing ), and so we only need to consider modulo 25.
Now, notice that for integers we have
Thus, for integral a: Using this process, we can essentially remove all the numbers which had not formerly been a multiple of 5 in from consideration.
Now, we consider the remnants of the 5, 10, 15, 20, ..., 90 not yet eliminated. The 10, 20, 30, ..., 90 becomes 1, 2, 3, 4, 1, 6, 7, 8, 9, whose product is 1 mod 25. Also, the 5, 5, 15, 25, ..., 85 becomes 1, 1, 3, 1, 7, 9, 11, 13, 3, 17 and . We deduce that from multiplying out the 1, 1, 3, 1, 7, ..., 17 is equivalent to 2 modulo 25, and so we need to compute . But this is simply by Fermat's Little Theorem . Because 12 is also a multiple of 4, we can utilize the Chinese Remainder Theorem to show that and so the answer is .
See also
2010 AMC 12A (Problems • Answer Key • Resources) | |
Preceded by Problem 22 |
Followed by Problem 24 |
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 AMC 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.