AMC 10 Step by Step

2016 AMC 10B Problem 6

P1-10~3 minPrint

Isaac added two three-digit positive integers. All six digits in these numbers are different. Isaac's sum is a three-digit number SS . What is the smallest possible value for the sum of the digits of SS ?

Log in to save your progress.
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 11, 22 and 33 are impossible, then find an example with 44.

Part 1: SS is at least 300300.

  1. The two numbers have different hundreds digits, and neither is 00. The smallest they can be is 11 and 22.
  2. So the two numbers add to at least 100+200=300100 + 200 = 300. Also SS has only three digits, so SS is somewhere from 300300 to 999999.

Part 2: digit sums 11, 22 and 33 are impossible.

3. The first digit of SS is at least 33, so the digit sum is at least 33. That already rules out 11 and 22.
4. A digit sum of exactly 33 would need S=300S = 300 (a 33 in front, zeros after).
5. Can two such numbers add to 300300? Look at the hundreds digits.
- If there is no carry into the hundreds place, the hundreds digits add to 33, so they are 11 and 22. Then the last two digits of both numbers must add to 0000 with no carry, which means all four of those digits are 00. That repeats the digit 00.
- If there is a carry of 11, the hundreds digits add to 22, so they are both 11. That repeats the digit 11.

Either way two digits are the same, so S=300S = 300 is impossible.

Part 3: digit sum 44 works.

  1. Aim for S=400S = 400. Try 143+257=400143 + 257 = 400. The six digits 1,4,3,2,5,71, 4, 3, 2, 5, 7 are all different, and 4+0+0=44 + 0 + 0 = 4.

The answer is (B) 4\boxed{\textbf{(B)}\ 4}.

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 400400 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 1+2=31 + 2 = 3. Hence S≥300S \ge 300, and SS is a three-digit number, so 300≤S≤999300 \le S \le 999.

A three-digit number with digit sum 11 is only 100100, and with digit sum 22 only 101,110,200101, 110, 200; all are below 300300. Digit sum 33 with S≥300S \ge 300 forces S=300S = 300. But S=300S = 300 needs the last two digits of the addends to sum to 0000 (no carry, hundreds digits 11 and 22, then all four remaining digits are 00) or to 100100 with hundreds digits 11 and 11; either way a digit repeats. So digit sum 33 is impossible.

Digit sum 44 is achievable: 143+257=400143 + 257 = 400, and the digits 1,4,3,2,5,71, 4, 3, 2, 5, 7 are all different.

The answer is (B) 4\boxed{\textbf{(B)}\ 4}.

Review in the AoPS books

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.