2017 AIME I 第 14 题

先试着解答 2017 AIME I 第 14 题,然后核对你的答案与精心整理的解答,解答来自 LIVE by Po-Shen Loh。你也可以参加完整限时模拟考试、查看全部 2017 AIME I 解答,或核对答案

所有题目均经美国数学协会(MAA)官方合法授权使用。

14.

a>1a \gt 1x>1x \gt 1 满足 loga ⁣(loga ⁣(loga2)+loga24128)\small \log_a\!\left(\log_a\!\left(\log_a 2\right) + \log_a 24 - 128\right) =128= 128,并且 loga ⁣(logax)=256\log_a\!\left(\log_a x\right) = 256。求 xx 除以 10001000 的余数。

Let a>1a \gt 1 and x>1x \gt 1 satisfy loga ⁣(loga ⁣(loga2)+loga24128)\small \log_a\!\left(\log_a\!\left(\log_a 2\right) + \log_a 24 - 128\right) =128= 128 and loga ⁣(logax)=256.\log_a\!\left(\log_a x\right) = 256. Find the remainder when xx is divided by 1000.1000.

答案:896
知识点:对数模幂运算欧拉函数中国剩余定理
难度评级:3270
解答:

对第一个方程两次取指数:loga(loga2)+loga24128\log_a(\log_a 2) + \log_a 24 - 128 =a128= a^{128} 变为 loga(24loga2)=128+a128\log_a(24 \log_a 2) = 128 + a^{128},所以 24loga2=a128aa12824 \log_a 2 = a^{128} \cdot a^{a^{128}},即 224=a(a128aa128)2^{24} = a^{\left(a^{128} \cdot a^{a^{128}}\right)}。令 t=aa128t = a^{a^{128}},右边为 ttt^t,左边为 (23)23\left(2^3\right)^{2^3},由 ttt^t 的严格单调性可得 aa128=8a^{a^{128}} = 8。写 c=log2a>0c = \log_2 a \gt 0,这说明 c2128c=3c \cdot 2^{128c} = 3。该式左边随 cc 增大而增大,且 c=364c = \frac{3}{64} 满足它,因为 36426=3\frac{3}{64} \cdot 2^6 = 3。所以 a=23/64a = 2^{3/64}

第二个方程给出 x=aa256x = a^{a^{256}}。这里 a256=22563/64=212=4096a^{256} = 2^{256 \cdot 3/64} = 2^{12} = 4096,所以 x=a4096=240963/64=2192.x = a^{4096} = 2^{4096 \cdot 3/64} = 2^{192}.

显然 21920(mod8)2^{192} \equiv 0 \pmod{8}。由欧拉定理,21001(mod125)2^{100} \equiv 1 \pmod{125},所以 219228(mod125)2^{192} \equiv 2^{-8} \pmod{125},也就是 2566256 \equiv 6 的逆元。因为 621=1261(mod125)6 \cdot 21 = 126 \equiv 1 \pmod{125},所以 219221(mod125)2^{192} \equiv 21 \pmod{125}。模 10001000 下同时满足模 8800、模 1251252121 的唯一余数是 896896

Exponentiating the first equation twice: loga(loga2)+loga24128\log_a(\log_a 2) + \log_a 24 - 128 =a128= a^{128} becomes loga(24loga2)=128+a128,\log_a(24 \log_a 2) = 128 + a^{128}, so 24loga2=a128aa128,24 \log_a 2 = a^{128} \cdot a^{a^{128}}, i.e. 224=a(a128aa128).2^{24} = a^{\left(a^{128} \cdot a^{a^{128}}\right)}. Setting t=aa128,t = a^{a^{128}}, the right side is ttt^t and the left side is (23)23,\left(2^3\right)^{2^3}, so by the strict monotonicity of ttt^t we get aa128=8.a^{a^{128}} = 8. Writing c=log2a>0,c = \log_2 a \gt 0, this says c2128c=3,c \cdot 2^{128c} = 3, which is increasing in cc and satisfied by c=364:c = \frac{3}{64}: indeed 36426=3.\frac{3}{64} \cdot 2^6 = 3. So a=23/64.a = 2^{3/64}.

The second equation gives x=aa256.x = a^{a^{256}}. Here a256=22563/64=212=4096,a^{256} = 2^{256 \cdot 3/64} = 2^{12} = 4096, so x=a4096=240963/64=2192.x = a^{4096} = 2^{4096 \cdot 3/64} = 2^{192}.

Clearly 21920(mod8).2^{192} \equiv 0 \pmod{8}. By Euler's theorem 21001(mod125),2^{100} \equiv 1 \pmod{125}, so 219228(mod125),2^{192} \equiv 2^{-8} \pmod{125}, the inverse of 2566.256 \equiv 6. Since 621=1261(mod125),6 \cdot 21 = 126 \equiv 1 \pmod{125}, we get 219221(mod125).2^{192} \equiv 21 \pmod{125}. The unique residue mod 10001000 that is 00 mod 88 and 2121 mod 125125 is 896.896.

← 第 13 题#13
完整试卷

其他年份的第 14 题