AMC 10 Step by Step

2012 AMC 10B Problem 20

P16-20~5 minPrint

Bernardo and Silvia play the following game. An integer between 0 and 999, inclusive, is selected and given to Bernardo. Whenever Bernardo receives a number, he doubles it and passes the result to Silvia. Whenever Silvia receives a number, she adds 50 to it and passes the result to Bernardo. The winner is the last person who produces a number less than 1000. Let NN be the smallest initial number that results in a win for Bernardo. What is the sum of the digits of NN ?

Log in to save your progress.
Show solution without answering

Key insight

Silvia only adds 50, so Bernardo wins exactly when he hands her a number from 950 to 999. Find the smallest start that lands there.

Solution

  1. Try a small start to see how the game goes. With N=1N = 1: Bernardo makes 22, Silvia 5252, Bernardo 104104, Silvia 154154, Bernardo 308308, Silvia 358358, Bernardo 716716, Silvia 766766, Bernardo 15321532. Bernardo went over 10001000 first, so Silvia made the last number under 10001000 and she wins.
  2. Who wins depends on who first goes over 999999. Bernardo wins when Silvia is the one who goes over. Silvia adds only 5050, so this happens when Bernardo hands her a number from 950950 to 999999.
  3. Write every number in terms of NN. Bernardo doubles, Silvia adds 5050:
Turn1234
Bernardo makes2N2N4N+1004N + 1008N+3008N + 30016N+70016N + 700
Silvia makes2N+502N + 504N+1504N + 1508N+3508N + 35016N+75016N + 750

(Bernardo's fifth number would be 32N+150032N + 1500, which is already over 10001000, so the game is always decided by then.)
4. For any starting NN, Bernardo's fourth number is his biggest, so it is the one that can reach 950950 with the smallest NN. Start there. Need 950≤16N+700≤999950 \le 16N + 700 \le 999:
- 16N+700≥95016N + 700 \ge 950 means 16N≥25016N \ge 250, so N≥15.6N \ge 15.6, that is N≥16N \ge 16;
- 16N+700≤99916N + 700 \le 999 means 16N≤29916N \le 299, so N≤18N \le 18.
So N=16,17,18N = 16, 17, 18 all win this way.
5. Could an earlier turn give a smaller NN? For 8N+300≥9508N + 300 \ge 950 we need N≥82N \ge 82, and the first two turns need even bigger NN. So nothing smaller than 1616 works.
6. Check N=16N = 16: Bernardo 3232, Silvia 8282, Bernardo 164164, Silvia 214214, Bernardo 428428, Silvia 478478, Bernardo 956956, Silvia 10061006. Silvia went over, so Bernardo's 956956 was the last number under 10001000. Bernardo wins.
7. The digit sum of 1616 is 1+6=71 + 6 = 7.

The answer is (A) 7\boxed{\textbf{(A)}\ 7}.

Why this works

A process that repeats "double, then add" turns into a simple expression in the starting number after each round, so the whole game fits in one table. The winning condition becomes a window: Bernardo must land just below 10001000, close enough that Silvia's +50+50 pushes her over. Turning "who wins" into an inequality is the key step.

Concise solution

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

Write out the numbers produced, starting from NN:

Bernardo2N2N4N+1004N+1008N+3008N+30016N+70016N+70032N+150032N+1500
Silvia2N+502N+504N+1504N+1508N+3508N+35016N+75016N+750

The outputs increase, and the game ends at the first output of 10001000 or more. Bernardo wins when that first big output is Silvia's, which happens exactly when some Bernardo output bb satisfies b<1000≤b+50b < 1000 \le b + 50, i.e. 950≤b≤999950 \le b \le 999. (Bernardo's own output 32N+150032N + 1500 is always at least 10001000, so the game never continues past Silvia's fourth turn.)

Test each Bernardo output for the smallest NN:
- 16N+700≥950  ⟺  N≥15.62516N + 700 \ge 950 \iff N \ge 15.625, and 16N+700≤999  ⟺  N≤1816N + 700 \le 999 \iff N \le 18. So N=16,17,18N = 16, 17, 18 work.
- 8N+300≥9508N + 300 \ge 950 needs N≥82N \ge 82; the earlier outputs need even larger NN.

The smallest winning NN is 1616: Bernardo produces 32,164,428,95632, 164, 428, 956 and Silvia then produces 10061006. The digit sum of 1616 is 1+6=71 + 6 = 7.

The answer is (A) 7\boxed{\textbf{(A)}\ 7}.

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.