2010 AMC 10A Problems/Problem 24: Difference between revisions
| Line 5: | Line 5: | ||
<math>\textbf{(A)}\ 12 \qquad \textbf{(B)}\ 32 \qquad \textbf{(C)}\ 48 \qquad \textbf{(D)}\ 52 \qquad \textbf{(E)}\ 68</math> | <math>\textbf{(A)}\ 12 \qquad \textbf{(B)}\ 32 \qquad \textbf{(C)}\ 48 \qquad \textbf{(D)}\ 52 \qquad \textbf{(E)}\ 68</math> | ||
== Solution 1 | == Solution 1 == | ||
We will use the fact that for any integer <math>n</math>, <cmath>\begin{align*}(5n+1)(5n+2)(5n+3)(5n+4)&=[(5n+4)(5n+1)][(5n+2)(5n+3)]\\ &=(25n^2+25n+4)(25n^2+25n+6)\equiv 4\cdot 6\\ &=24\pmod{25}\equiv -1\pmod{25}.\end{align*}</cmath> | We will use the fact that for any integer <math>n</math>, <cmath>\begin{align*}(5n+1)(5n+2)(5n+3)(5n+4)&=[(5n+4)(5n+1)][(5n+2)(5n+3)]\\ &=(25n^2+25n+4)(25n^2+25n+6)\equiv 4\cdot 6\\ &=24\pmod{25}\equiv -1\pmod{25}.\end{align*}</cmath> | ||
| Line 24: | Line 24: | ||
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<br \> | First, we list out all the numbers<br \> | ||
Revision as of 17:32, 3 May 2020
Problem
The number obtained from the last two nonzero digits of
is equal to
. What is
?
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
. 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
![]()
Since we must get rid of ending
s, we get rid of
and the corresponding ![]()
Next, we note that
,
, and
, so it can be simplified to
![]()
Then, we bash using these following
difference of squares tricks and multiplication
1. ![]()
2. ![]()
3. ![]()
4. ![]()
Handling of powers of
and
are especially critical
In the end, we get
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 | ||
These problems are copyrighted © by the Mathematical Association of America.