/

AMC12 2010 A

AMC12 2010 A · Q23

AMC12 2010 A · Q23. It mainly tests Primes & prime factorization, Remainders & modular arithmetic.

The number obtained from the last two nonzero digits of $90!$ is equal to $n$. What is $n$?
由 $90!$ 的最后两个非零数字组成的数等于 $n$。$n$ 是多少?
(A) 12 12
(B) 32 32
(C) 48 48
(D) 52 52
(E) 68 68
Answer
Correct choice: (A)
正确答案:(A)
Solution
We will use the fact that for any integer $n$, \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*} First, we find that the number of factors of $10$ in $90!$ is equal to $\left\lfloor \frac{90}5\right\rfloor+\left\lfloor\frac{90}{25}\right\rfloor=18+3=21$. Let $N=\frac{90!}{10^{21}}$. The $n$ we want is therefore the last two digits of $N$, or $N\pmod{100}$. If instead we find $N\pmod{25}$, we know that $N\pmod{100}$, what we are looking for, could be $N\pmod{25}$, $N\pmod{25}+25$, $N\pmod{25}+50$, or $N\pmod{25}+75$. Only one of these numbers will be a multiple of four, and whichever one that is will be the answer, because $N\pmod{100}$ has to be a multiple of 4. If we divide $90!$ by $5^{21}$ to create $M$ by taking out all the factors of $5$ in $90!$, we can write $N$ as $\frac M{2^{21}}$ where \[M=1\cdot 2\cdot 3\cdot 4\cdot 1\cdot 6\cdot 7\cdot 8\cdot 9\cdot 2\cdots 89\cdot 18,\] where every multiple of 5 is replaced by the number with all its factors of 5 removed. Specifically, every number in the form $5n$ is replaced by $n$, and every number in the form $25n$ is replaced by $n$. The number $M$ can be grouped as follows: \begin{align*}M= &(1\cdot 2\cdot 3\cdot 4)(6\cdot 7\cdot 8\cdot 9)\cdots(86\cdot 87\cdot 88\cdot 89)\\ &\cdot (1\cdot 2\cdot 3\cdot 4)(6\cdot 7\cdot 8\cdot 9)\cdots (16\cdot 17\cdot 18) \\ &\cdot (1\cdot 2\cdot 3).\end{align*} Where the first line is composed of the numbers in $90!$ 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 $M$ to \begin{align*}M&\equiv(-1)^{18} \cdot (-1)^3(16\cdot 17\cdot 18) \cdot (1\cdot 2\cdot 3) \\ &= 1\cdot -21\cdot 6\\ &= -1\pmod{25} =24\pmod{25}.\end{align*} Using the fact that $2^{10}=1024\equiv -1\pmod{25}$ (or simply the fact that $2^{21}=2097152$ if you have your powers of 2 memorized), we can deduce that $2^{21}\equiv 2\pmod{25}$. Therefore $N=\frac M{2^{21}}\equiv \frac {24}2\pmod{25}=12\pmod{25}$. Finally, combining with the fact that $N\equiv 0\pmod 4$ yields $n=\boxed{\textbf{(A)}\ 12}$.
我们将使用如下事实:对任意整数 $n$, \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*} 首先,$90!$ 中因子 $10$ 的个数为 $\left\lfloor \frac{90}5\right\rfloor+\left\lfloor\frac{90}{25}\right\rfloor=18+3=21$。令 $N=\frac{90!}{10^{21}}$。我们要找的 $n$ 就是 $N$ 的最后两位数字,即 $N\pmod{100}$。如果先求 $N\pmod{25}$,则 $N\pmod{100}$(也就是我们要找的)可能是 $N\pmod{25}$、$N\pmod{25}+25$、$N\pmod{25}+50$ 或 $N\pmod{25}+75$。其中只有一个是 $4$ 的倍数,而那个就是答案,因为 $N\pmod{100}$ 必须是 $4$ 的倍数。 把 $90!$ 除以 $5^{21}$ 去掉其中所有的 $5$ 因子,得到 $M$,则可写 $N=\frac M{2^{21}}$,其中 \[M=1\cdot 2\cdot 3\cdot 4\cdot 1\cdot 6\cdot 7\cdot 8\cdot 9\cdot 2\cdots 89\cdot 18,\] 这里每个 $5$ 的倍数都被替换为去掉所有 $5$ 因子后的数。具体地,形如 $5n$ 的数替换为 $n$,形如 $25n$ 的数替换为 $n$。 $M$ 可按如下方式分组: \begin{align*}M= &(1\cdot 2\cdot 3\cdot 4)(6\cdot 7\cdot 8\cdot 9)\cdots(86\cdot 87\cdot 88\cdot 89)\\ &\cdot (1\cdot 2\cdot 3\cdot 4)(6\cdot 7\cdot 8\cdot 9)\cdots (16\cdot 17\cdot 18) \\ &\cdot (1\cdot 2\cdot 3).\end{align*} 其中第一行由 $90!$ 中不是 $5$ 的倍数的数构成;第二行是那些是 $5$ 的倍数但不是 $25$ 的倍数的数除以 $5$ 后得到的;第三行是 $25$ 的倍数除以 $25$ 后得到的。 利用解答开头的恒等式,可将 $M$ 化简为 \begin{align*}M&\equiv(-1)^{18} \cdot (-1)^3(16\cdot 17\cdot 18) \cdot (1\cdot 2\cdot 3) \\ &= 1\cdot -21\cdot 6\\ &= -1\pmod{25} =24\pmod{25}.\end{align*} 利用 $2^{10}=1024\equiv -1\pmod{25}$(或者直接用 $2^{21}=2097152$),可推出 $2^{21}\equiv 2\pmod{25}$。因此 $N=\frac M{2^{21}}\equiv \frac {24}2\pmod{25}=12\pmod{25}$。 最后结合 $N\equiv 0\pmod 4$,得到 $n=\boxed{\textbf{(A)}\ 12}$。
Topics
Related Questions
Practice full AMC exams on amcdrill.
Try full-length practice and diagnostics at www.amcdrill.com.