Let P be the set of seven digit numbers with sum of their digits equal to 11 . If the numbers in P are formed by using the digits 1,2 and 3 only, then the number of elements in the set is :
We need to find the number of 7-digit numbers formed using only digits 1, 2, and 3 such that the sum of digits equals 11.
Let the seven digits be where each and .
Let , so . Then:
We need to count the number of solutions to where .
Without the upper bound constraint, the number of non-negative integer solutions is .
Now subtract cases where any . If , let . Then the sum becomes . The number of non-negative solutions is .
There are ways to choose which variable exceeds 2, giving cases.
No two variables can simultaneously be since that would require a sum . So higher-order inclusion-exclusion terms are zero.
The correct answer is Option 4: 161.
Tagged Combinations and selections with conditions. Machine-assigned, so read it as a strong shortlist rather than a verdict.