To find the number of seven-digit integers whose digits sum to 10 and are formed using only the digits 1,2, and 3, let the seven digits be denoted by d1,d2,d3,d4,d5,d6,d7, where di∈{1,2,3} for each i=1,2,…,7.
We are given the condition:
d1+d2+d3+d4+d5+d6+d7=10
Let xi=di−1. Since di∈{1,2,3}, we have xi∈{0,1,2}.
Substituting di=xi+1 into the sum:
(x1+1)+(x2+1)+⋯+(x7+1)=10
x1+x2+x3+x4+x5+x6+x7=3
We now need to find the number of non-negative integer solutions to:
x1+x2+⋯+x7=3such that0≤xi≤2 for each i
We can analyze the possible partitions of the sum 3:
-
Partition 1+1+1:
Three of the xi's are equal to 1, and the remaining four are 0.
This corresponds to the digits being three 2's and four 1's:
Number of arrangements=3!4!7!=6×245040=35
-
Partition 2+1+0:
One of the xi's is equal to 2, one is equal to 1, and the remaining five are 0.
This corresponds to the digits being one 3, one 2, and five 1's:
Number of arrangements=1!1!5!7!=1205040=42
-
Partition 3+0+0:
One of the xi's is equal to 3, which corresponds to a digit di=4. Since the only permitted digits are 1,2, and 3, this case is not allowed.
Adding the valid arrangements together:
Total number of seven-digit integers=35+42=77
Therefore, the correct option is C.