Difference between revisions of "2015 AIME I Problems/Problem 8"

Revision as of 20:13, 9 February 2018

Problem

For positive integer $n$ , let $s(n)$ denote the sum of the digits of $n$ . Find the smallest positive integer satisfying $s(n) = s(n+864) = 20$ .

Solution

You know whatever $n$ is, it has to have 3 digits, because if it had only two, the maximum of $s(n)$ is 18.

Now let $n=100a_2+10a_1+a_0$

So first we know, $a_2+a_1+a_0=20$ . Okay now we have to split into cases based on which digit gets carried. This meaning, when you add a 3 digit number to 864, we have to know when to carry the digits. Note that if you don't understand any of the steps I take, just try adding any 3-digit number to 864 regularly (using the old-fashioned "put one number over the other" method, not mental calculation), and observe what you do at each step.

(1) None of the digit gets carried over to the next space: So this means $a_2<2, a_1<4$ and $a_0<6$ . So

$s(864+n)=(8+a_2)+(6+a_1)+(4+a_0)=38$ So it doesn't work. Now:

(2) $a_2+8$ is the only one that carries over So this means $a_2>1, a_1<4$ and $a_0<6$ . So

$s(864+n)=1+(8+a_2-10)+(6+a_1)+(a_0+4)=29$

(3) $a_0+4$ is the only one that carries over. So

$s(864+n)=(8+a_2)+(6+a_1+1)+(4+a_0-10)=29$

(4)The first and second digit carry over (but not the third)

$s(864+n)=1+(8+a_2-10+1)+(6+a_1-10)+(4+a_0)=20$

Aha! This case works but we still have to make sure it's possible for $a_2+a_1+a_0=20$ (We assumed this is true, so we have to find a number that works.) Since only the second and first digit carry over, $a_2>0, a_1>3$ and $a_0<6$ . The smallest value we can get with this is 695. Let's see if we can find a smaller one:

(5)The first and third digit carry over (but not the second)

$s(864+n)=1+(8+a_2-10)+(7+a_1)+(4+a_0-10)=20$

The largest value for the middle digit is 2, so the other digits have to be both 9's. So the smallest possible value is 929

(6) All the digits carry over

$s(864+n)=1+(9+a_2-10)+(7+a_1-10)+(4+a_0-10)=\text{Way less than 20}$

So the answer is $\boxed{695}$ which after a quick test, does indeed work.

Solution 2

First, it is easy to verify that $695$ works and that no other numbers beginning with the digit 6 work (i.e. $686, 677, 668, 659$ do not work).

Suppose by contradiction that there is a smaller valid $n$ , where the leading digit of the three-digit number $n$ is 5 or less. (Two-digit $n$ obviously do not work because 9 + 9 < 20.) Clearly $n > 200$ because the smallest three-digit number whose digits sum to 20 is $299$ . Also, because the second digit is at most 9, the units digit is at least 6, which means that the addition $N = n + 864$ regroups in the ones place. Then the units digit of $N$ is clearly less than 4. But as $1000 < 200 + 864 < N < 600 + 864 = 1464$ , the sum of the thousands digit and the hundredth digit is at most 5. Because the second digit is at most 9, the sum of the digits of $N$ is at most $5 + 9 + 4 < 20$ , contradiction. Hence $\boxed{695}$ is the answer.

Motivation for Solution 2

During the real test, I immediately noticed that $n$ must be less than 1000 (AIME problem) and that $n$ must be a three-digit number. Therefore, I began casework on the leading digit of $n$ . The casework was not intensive (how many ways are there to have digits sum to 20?) and I eventually got 695 as my answer. The rigorous proof that 695 was the smallest came afterwards.

Solution 3

First of all, notice that the smallest $n$ with $s(n) = 20$ is $299$ . Also, if $s(n + 864) = 20$ , $s(n - 136) = 19$ (because subtracting $1000$ from the number removes the $1$ in the thousands place). After checking $s(n - 136)$ for various $n$ with $s(n) = 20$ , we see that we need to have a carry when subtracting $136$ . To have this, we must either have a $2$ in the tens place or a $5$ in the units place. The minimum $n$ for the former is $929$ , and for the latter it is $695$ . We check and see that $s(695-136) = s(559) = 19$ , so our answer is $\boxed{695}$ .

@@ Line 53: / Line 53: @@
 During the real test, I immediately noticed that <math>n</math> must be less than 1000 (AIME problem) and that <math>n</math> must be a three-digit number. Therefore, I began casework on the leading digit of <math>n</math>. The casework was not intensive (how many ways are there to have digits sum to 20?) and I eventually got 695 as my answer. The rigorous proof that 695 was the smallest came afterwards.
+==Solution 3==
+First of all, notice that the smallest <math>n</math> with <math>s(n) = 20</math> is <math>299</math>. Also, if <math>s(n + 864) = 20</math>, <math>s(n - 136) = 19</math> (because subtracting <math>1000</math> from the number removes the <math>1</math> in the thousands place). After checking <math>s(n - 136)</math> for various <math>n</math> with <math>s(n) = 20</math>, we see that we need to have a carry when subtracting <math>136</math>. To have this, we must either have a <math>2</math> in the tens place or a <math>5</math> in the units place. The minimum <math>n</math> for the former is <math>929</math>, and for the latter it is <math>695</math>. We check and see that <math>s(695-136) = s(559) = 19</math>, so our answer is <math>\boxed{695}</math>.
 == See also ==
 {{AIME box|year=2015|n=I|num-b=7|num-a=9}}
 {{MAA Notice}}
 [[Category:Introductory Number Theory Problems]]

2015 AIME I (Problems • Answer Key • Resources)
Preceded by Problem 7	Followed by Problem 9
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions

Page

Toolbox

Search