Skip to main content

2012 AMC 10B Problem 20

Problem 20 of 25HarderAlgebraNumber Theory

Bernardo and Silvia play the following game. An integer between 00 and 999999 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 5050 to it and passes the result to Bernardo. The winner is the last person who produces a number less than 1000.1000. Let NN be the smallest initial number that results in a win for Bernardo. What is the sum of the digits of N?N?

Answer choices

Show solution

Solution

If the initial number is x,x, Bernardo’s successive outputs are 2x,4x+100,8x+300,16x+700,32x+1500.\begin{gathered} 2x,\quad4x+100,\quad8x+300,\\ 16x+700,\quad32x+1500. \end{gathered} Silvia’s output after each of these is 5050 larger. Bernardo wins on a given turn exactly when his output is below 10001000 but the following output from Silvia is at least 1000.1000. For the first four Bernardo turns, the smallest integer xx satisfying those two inequalities is, respectively, 475,213,82,475,213,82, and 16.16. A fifth Bernardo output is already at least 1500.1500. Thus the smallest winning initial number is N=16,N=16, whose digit sum is 1+6=7.1+6=7. Thus, the correct answer is A .

More practice

Concepts: recursion · inequality · digits

Problem text and solution from the LIVE past-contest archive. See also the AoPS wiki page for community solutions.