2013 AMC 12B Problem 23

Attempt Problem 23 of the 2013 AMC 12B below, then check your answer against the professionally curated solution from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2013 AMC 12B solutions, or check the answer key.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

23.

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

Answer: E
Concepts:number basemodular arithmeticcasework
Difficulty rating: 2510
Solution:

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.

← Problem 22#22
Full Exam

Problem 23 in Other Years