2013 AMC 12B 第 23 题

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

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

23.

Bernardo 选择一个三位正整数 NN,并把它以 55 为底和以 66 为底的表示都写在黑板上。后来 LeRoy 看到了 Bernardo 写的两个数。他把这两个表示当作以 1010 为底的整数相加,得到整数 SS。例如,若 N=749N = 749,Bernardo 写下 10,44410{,}4443,2453{,}245,LeRoy 得到 S=13,689S = 13{,}689。有多少个 NN 使得 SS 最右边两位数字按顺序与 2N2N 的最右边两位数字相同?

Bernardo chooses a three-digit positive integer NN and writes both its base-55 and base-66 representations on a blackboard. Later LeRoy sees the two numbers Bernardo has written. Treating the two numbers as base-1010 integers, he adds them to obtain an integer S.S. For example, if N=749,N = 749, Bernardo writes the numbers 10,44410{,}444 and 3,245,3{,}245, and LeRoy obtains the sum S=13,689.S = 13{,}689. For how many choices of NN are the two rightmost digits of S,S, in order, the same as those of 2N?2N?

55

1010

1515

2020

2525

答案:E
知识点:进制模运算分类讨论
难度评级:2510
解答:

因为 lcm(25,36,100)=900\mathrm{lcm}(25, 36, 100) = 900,关于 NN 的条件只取决于 Nmod900N \bmod 900,所以考虑 0N8990 \le N \le 899。设以 55 为底的表示的末两位为 a1,a0a_1, a_0,以 66 为底的表示的末两位为 b1,b0b_1,b_0。要使 1010Na0(mod5)N\equiv a_0\pmod5 在通常书写法下的末两位数字相同,首先必须有个位相等,即 a0=b0a_0=b_0;然后模 100100 计算得到恰有 55 个有效的 363610(a1+b1)+a0+b010(a_1+b_1)+a_0+b_05a1b1(mod10)5a_1\equiv b_1\pmod{10}(0,0),(2,0),(4,0),(1,5),(3,5)(0,0),(2,0),(4,0),(1,5),(3,5)2525、。每个可与 个 a0a_0 选择结合((0a04)(0 \le a_0 \le 4)),共 2525NN。所以正确答案是 EN180a1+150b1+a0(mod900). \begin{aligned} N&\equiv180a_1+150b_1 \\ &\quad {}+a_0\pmod{900}. \end{aligned}

Because lcm(25,36,100)=900,\mathrm{lcm}(25, 36, 100) = 900, the condition on NN depends only on Nmod900,N \bmod 900, so consider 0N899.0 \le N \le 899. Let the last two base-55 digits be a1,a0a_1, a_0 and the last two base-66 digits be b1,b0.b_1,b_0. Modulo 10,10, the desired equality and Na0(mod5)N\equiv a_0\pmod5 force a0=b0.a_0=b_0. The Chinese Remainder Theorem applied modulo 2525 and 3636 then gives N180a1+150b1+a0(mod900). \begin{aligned} N&\equiv180a_1+150b_1 \\ &\quad {}+a_0\pmod{900}. \end{aligned} Comparing twice this residue modulo 100100 with the decimal number 10(a1+b1)+a0+b010(a_1+b_1)+a_0+b_0 reduces to 5a1b1(mod10).5a_1\equiv b_1\pmod{10}. Hence the valid pairs are exactly (0,0),(2,0),(4,0),(1,5),(3,5).(0,0),(2,0),(4,0),(1,5),(3,5). Each combines with 55 choices of a0a_0 (0a04),(0 \le a_0 \le 4), giving 2525 values of N.N. Thus, the correct answer is E.

← 第 22 题#22
完整试卷

其他年份的第 23 题