AMC 10 Step by Step

2013 AMC 10B Problem 25

P21-25~12 minPrint

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

Log in to save your progress.
Show solution without answering

Key insight

The last digits in base 5 and base 6 must match, so N is 30m plus a remainder from 0 to 4. The tens digits then depend only on m.

Solution

Only the last two digits of SS matter, and those come only from the last two digits of each number Bernardo writes. So we need the last two digits of NN in base 55 and in base 66.

Names. Let the base-5 form of NN end in the digits d1d0d_1 d_0 and the base-6 form end in e1e0e_1 e_0. The last digit d0d_0 is the remainder when NN is divided by 55, and e0e_0 is the remainder when NN is divided by 66.

Step 1: the units digit.

1. NN is a multiple of 55 plus d0d_0, so 2N2N is a multiple of 1010 plus 2d02d_0. Since d0≤4d_0 \le 4, the units digit of 2N2N is 2d02d_0.
2. The units digit of SS comes from d0+e0d_0 + e_0, which is at most 4+5=94 + 5 = 9, so there is no carry. We need d0+e0=2d0d_0 + e_0 = 2d_0, which means e0=d0e_0 = d_0.
3. So NN leaves the same remainder rr when divided by 55 and by 66, and rr is 0,1,2,30, 1, 2, 3 or 44. Then N−rN - r is a multiple of both 55 and 66, so of 3030:
N=30m+r,r=0,1,2,3 or 4.N = 30m + r, \qquad r = 0, 1, 2, 3 \text{ or } 4.
(The example N=749=30×24+29N = 749 = 30 \times 24 + 29 fails this: its last digits 44 and 55 give 99, but 2N=14982N = 1498 ends in 88.)

Step 2: the tens digit.

4. Let kk be the whole-number part of N÷25N \div 25. Then N=25k+5d1+d0N = 25k + 5d_1 + d_0, so
2N=50k+10d1+2d0.2N = 50k + 10d_1 + 2d_0.
If kk is even, 50k50k is a multiple of 100100 and does not touch the last two digits. If kk is odd, it adds 5050. So the tens digit of 2N2N is d1d_1 when kk is even, and d1+5d_1 + 5 (dropping any extra 1010) when kk is odd.
5. The tens digit of SS comes from d1+e1d_1 + e_1. For these to match, we need e1=0e_1 = 0 when kk is even and e1=5e_1 = 5 when kk is odd. (The digit e1e_1 is at most 55, so no other value can work.)

Step 3: turn this into a condition on mm.

  1. The base-6 tens digit e1e_1 is the remainder when N÷6N \div 6 (whole-number part) is divided by 66. Since N=30m+rN = 30m + r with r<6r < 6, the whole-number part of N÷6N \div 6 is 5m5m. The remainder of 5m5m divided by 66:
mm leaves remainder (divided by 6)012345
e1e_1054321

So e1=0e_1 = 0 needs mm to be a multiple of 66, and e1=5e_1 = 5 needs mm to be one more than a multiple of 66.
7. The value of kk depends only on mm: 30m30m is a multiple of 55, so adding r≤4r \le 4 never reaches the next multiple of 2525.
8. NN has three digits, so 100≤30m+r≤999100 \le 30m + r \le 999, which means mm runs from 44 to 3333. Check the candidates:

mm612182430
30m30m180360540720900
kk714212836
is kk even?noyesnoyesyes
mm713192531
30m30m210390570750930
kk815223037
is kk odd?noyesnonoyes

The values that work are m=12,24,30m = 12, 24, 30 and m=13,31m = 13, 31: five values.
9. Each mm goes with 55 choices of rr, so there are 5×5=255 \times 5 = 25 values of NN.

Check one: N=360N = 360 is 24202420 in base 55 and 14001400 in base 66. Then S=2420+1400=3820S = 2420 + 1400 = 3820, and 2N=7202N = 720. Both end in 2020.

The answer is (E) 25\boxed{\textbf{(E)}\ 25}.

Why this works

Only the last two digits of each representation affect the last two digits of SS, so everything comes down to remainders. Handle the units digit first: it cuts the search down to numbers of the form 30m+r30m + r. Then the tens digit becomes a simple even-or-odd check, leaving a short table instead of hundreds of cases.

Concise solution

A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.

Let the last two base-5 digits of NN be d1d0d_1 d_0 and the last two base-6 digits be e1e0e_1 e_0. Then N≡5d1+d0(mod25)N \equiv 5d_1 + d_0 \pmod{25} and N≡6e1+e0(mod36)N \equiv 6e_1 + e_0 \pmod{36}, while LeRoy's sum satisfies S≡10(d1+e1)+(d0+e0)(mod100)S \equiv 10(d_1 + e_1) + (d_0 + e_0) \pmod{100}.

Units digit. N≡d0(mod5)N \equiv d_0 \pmod 5 gives 2N≡2d0(mod10)2N \equiv 2d_0 \pmod{10}. We need d0+e0≡2d0(mod10)d_0 + e_0 \equiv 2d_0 \pmod{10}, so e0=d0e_0 = d_0: the remainders of NN mod 55 and mod 66 agree. Hence N=30m+rN = 30m + r with 0≤r≤40 \le r \le 4. Since d0≤4d_0 \le 4, the units sum 2d02d_0 produces no carry.

Tens digit. Write N=25k+5d1+d0N = 25k + 5d_1 + d_0, so 2N=50k+10d1+2d02N = 50k + 10d_1 + 2d_0. The condition becomes 10(d1+e1)≡50k+10d1(mod100)10(d_1 + e_1) \equiv 50k + 10d_1 \pmod{100}, i.e. e1≡5k(mod10)e_1 \equiv 5k \pmod{10}. As e1≤5e_1 \le 5: e1=0e_1 = 0 if kk is even and e1=5e_1 = 5 if kk is odd.

Now e1e_1 is the base-6 tens digit, ⌊N/6⌋ mod 6=5m mod 6\lfloor N/6 \rfloor \bmod 6 = 5m \bmod 6, which is 00 when m≡0m \equiv 0 and 55 when m≡1(mod6)m \equiv 1 \pmod 6. And k=⌊N/25⌋k = \lfloor N/25 \rfloor depends only on mm since r≤4r \le 4.

For 100≤N≤999100 \le N \le 999, mm runs from 44 to 3333. Check m≡0m \equiv 0 (need kk even): m=6,12,18,24,30m = 6, 12, 18, 24, 30 give k=7,14,21,28,36k = 7, 14, 21, 28, 36, so m=12,24,30m = 12, 24, 30 work. Check m≡1m \equiv 1 (need kk odd): m=7,13,19,25,31m = 7, 13, 19, 25, 31 give k=8,15,22,30,37k = 8, 15, 22, 30, 37, so m=13,31m = 13, 31 work.

Five values of mm, each with five choices of rr: 2525.

The answer is (E) 25\boxed{\textbf{(E)}\ 25}.

Review in the AoPS books

Similar problems

Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.