2016 AMC 12A Problems/Problem 25
Let be a positive integer. Bernardo and Silvia take turns writing and erasing numbers on a blackboard as follows: Bernardo starts by writing the smallest perfect square with digits. Every time Bernardo writes a number, Silvia erases the last digits of it. Bernardo then writes the next perfect square, Silvia erases the last digits of it, and this process continues until the last two numbers that remain on the board differ by at least 2. Let be the smallest positive integer not written on the board. For example, if , then the numbers that Bernardo writes are , and the numbers showing on the board after Silvia erases are and , and thus . What is the sum of the digits of ?
Consider . The numbers left on the blackboard will show the hundreds place at the end. In order for the hundreds place to differ by 2, the difference between two perfect squares needs to be at least . Since , this first happens at . The perfect squares from here go: . Note that the ones and tens also make the perfect squares, . After the ones and tens make , the hundreds place will go up by , thus reaching our goal. Since , the last perfect square to be written will be . The missing number is one less than the number of hundreds of , or .
Now consider . Instead of the difference between two squares needing to be , the difference must now be . This first happens at . After this point, similarly, more numbers are needed to make the th's place go up by . This will take place at . Removing the last four digits (the zeros) and subtracting one yields for the skipped value.
In general, each new value of will add two digits to the "" and one digit to the "". This means that the last number Bernardo writes for is , the last for will be , and so on until . Removing the last digits as Silvia does will be the same as removing trailing zeroes on the number to be squared. This means that the last number on the board for is , is , and so on. So the first missing number is The squaring will make a "" with two more digits than the last number, a "" with one more digit, and a "". The missing number is one less than that, so the "1" will be subtracted from . In other words, .
And so on. The sum is:
+ , with repetitions each of "" and "". There is no carrying in this addition. Therefore each adds to the sum of the digits. Since , , and , or .
Solution 2 (Rigorous)
We assume for all claims.
We will let . This is the result when the last k digits are truncated off .
Let = the smallest a, such that
We then have
Proof of Claim 1:
Assume for the sake of contradiction, we have
Note that since , we have
It is well known that for any and
Since satisfies the condition, we have:
This is a contradiction.
Proof of Claim 2:
We will show our choice of satisfies the criteria above.
Now, we will show all values smaller than don’t satisfy the criteria. We will assume for the sake of contradiction, there exists an which satisfies the criteria.
We will write as . By our hypothesis, we have . We also have by claim 1.
This gets a contradiction.
Claim 3: .
Proof of Claim 3: Because of claim 2, is . Note that and are the first numbers written that will differ by at least 2. Thus,
Thus, . This addition has no regroups/carry overs, so we can just take the sums of the digits of each of the addends, and sum them together to get 8064.
Video Solution by The Art of Problem Solving
|2016 AMC 12A (Problems • Answer Key • Resources)|
|1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25|
|All AMC 12 Problems and Solutions|
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.