2012 AMC 10B Problem 20

Below is the professionally curated solution for Problem 20 of the 2012 AMC 10B, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2012 AMC 10B solutions, or check the answer key.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Concepts:recursioninequalitydigits

Difficulty rating: 1930

20.

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?

7 7

8 8

9 9

10 10

11 11

Solution:

Suppose xx was our initial number. Then, it becomes 2x2x when given to Silvia, and 2x+502x+50 when given to Bernardo. Repeatedly doing this can yield that it eventually becomes 16x+70016x+700 when given to Silvia and 16x+75016x+750 when given to Bernardo. Any more iterations makes the number greater than 1000.1000.

The number given to Silvia must be below 10001000 and the number Silvia makes is greater than 1000,1000, so 16x+750>1000>16x+700.16x+750 > 1000 > 16x+700 .

Therefore, 300>16x>250.300 > 16x > 250 . This makes 18x16,18 \geq x \geq 16, so N=16.N=16. As such, the sum of the digits of NN is 1+6=7.1+6=7.

Thus, the correct answer is A .

Problem 20 in Other Years