Bunuel
For each set of three distinct nonzero digits, consider the sum of all positive three-digit integers that can be formed by the digits. For example, for the three digits 1, 2, and 3, the sum of all positive three-digit integers that can be formed by the digits is 123 + 132 + 213 + 231 + 312 + 321 = 1,332. How many different integers are equal to such a sum?
A. 9
B. 11
C. 14
D. 19
E. 24
In each of the selected sets of three numbers, say \(x, y, \text{and}, z\) the value of the sum depends on the value of x, y, and z. This is because in each place we add two values of x + two values of y + two values of z + any carryover.
For example
123 + 132 + 213 + 231 + 312 + 321
To calculate the unit digit we must add (2 * 1) + (2 * 2) + (2 * 3) = 1
2To calculate the tens digit we must add (2 * 1) + (2 * 2) + (2 * 3) + 1 (carry from units place) = 1
3To calculate the hundreds digit we must add (2 * 1) + (2 * 2) + (2 * 3) + 1 (carry from tens place) =
13Hence, we would obtain a different sum for different values of \(x + y + z.\)
Minimum value of \(x + y + z = 1 + 2 + 3 = 6\)
Maximum value of \(x + y + z = 7 + 8 + 9 = 24\)
Number of possible values = \(24 - 6 + 1 = 24 - 5 = 19\)
Clarification on the last part of the question "How many different integers are equal to such a sum?"As mentioned above what matter is the possible values of \(x + y + z\). Different combinations of \(xyz\) can lead to the same sum if the value of \(x + y + z\) is the same. For example, \(xyz = 457\) and \(xyz = 367\) (or \(xyz = 187\)) will lead to the same sum as in all cases x + y + z = 16. We need to count the sum only once. Option D