2016 AMC 10B Problem 6
Isaac added two three-digit positive integers. All six digits in these numbers are different. Isaac's sum is a three-digit number . What is the smallest possible value for the sum of the digits of ?
Show solution without answering
Key insight
The hundreds digits differ and are not zero, so S is at least 300. Digit sums 1 to 3 fail, and 143 + 257 = 400 gives 4.
Solution
This asks for the smallest possible value, so there are two parts: show that , and are impossible, then find an example with .
Part 1: is at least .
- The two numbers have different hundreds digits, and neither is . The smallest they can be is and .
- So the two numbers add to at least . Also has only three digits, so is somewhere from to .
Part 2: digit sums , and are impossible.
3. The first digit of is at least , so the digit sum is at least . That already rules out and .
4. A digit sum of exactly would need (a in front, zeros after).
5. Can two such numbers add to ? Look at the hundreds digits.
- If there is no carry into the hundreds place, the hundreds digits add to , so they are and . Then the last two digits of both numbers must add to with no carry, which means all four of those digits are . That repeats the digit .
- If there is a carry of , the hundreds digits add to , so they are both . That repeats the digit .
Either way two digits are the same, so is impossible.
Part 3: digit sum works.
- Aim for . Try . The six digits are all different, and .
The answer is .
Why this works
For a "smallest possible" question, first find a lower limit, then show an example that reaches it. Here the lower limit comes from the hundreds digits, which must be different. To build the example, aim for a round number like and let the ones and tens columns carry.
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
The two hundreds digits are nonzero and different from each other, so they add to at least . Hence , and is a three-digit number, so .
A three-digit number with digit sum is only , and with digit sum only ; all are below . Digit sum with forces . But needs the last two digits of the addends to sum to (no carry, hundreds digits and , then all four remaining digits are ) or to with hundreds digits and ; either way a digit repeats. So digit sum is impossible.
Digit sum is achievable: , and the digits are all different.
The answer is .
Review in the AoPS books
- Introduction to Number Theory, Chapter 8: Base Numbers
- Introduction to Number Theory, Chapter 1: Integers: The Basics
- Introduction to Number Theory, Chapter 9: Base Number Arithmetic
- Introduction to Algebra, Chapter 20: Special Functions (§20.3)
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.