Difference between revisions of "2010 AMC 10A Problems/Problem 24"
(→Solution) |
(→Solution 2(bash)) |
||
Line 25: | Line 25: | ||
Finally, combining with the fact that <math>N\equiv 0\pmod 4</math> yields <math>n=\boxed{\textbf{(A)}\ 12}</math>. | Finally, combining with the fact that <math>N\equiv 0\pmod 4</math> yields <math>n=\boxed{\textbf{(A)}\ 12}</math>. | ||
== Solution 2(bash) == | == Solution 2(bash) == | ||
+ | First, we list out all the numbers | ||
+ | <math>90!=2^{65}3^{44}5^{21}7^{13}11^813^617^519^423^329^331^237^241^243^2\cdot47\cdot53\cdot\cdot\cdot89</math> | ||
== See also == | == See also == |
Revision as of 19:55, 1 February 2020
Problem
The number obtained from the last two nonzero digits of is equal to . What is ?
Solution 1(Bigbrain)
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 . Since there is clearly an excess of factors of 2, we know that , so it remains to find .
We can write as where where every number in the form is replaced by .
The number can be grouped as follows:
Hence, we can reduce to
Using the fact that ,we can deduce that . Therefore .
Finally, combining with the fact that yields .
Solution 2(bash)
First, we list out all the numbers
See also
2010 AMC 10A (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 AMC 10 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.