Let be a matrix having entries from the set . The number of all such matrices having sum of all the entries equal to , is ______.
We need to count matrices with entries from whose entries sum to .
Let be the number of entries equal to 1, be the number equal to , and the number equal to 0. We require and with . Since , substituting yields , hence .
When , it follows that and there are 4 zeros. Choosing 5 positions for 1’s among 9 gives .
For , we have and 2 zeros; thus we choose 6 positions for 1’s and 1 of the remaining 3 positions for a , giving .
When , then and there are no zeros, so we select 7 positions for 1’s (the remaining 2 are ’s), yielding .
Adding these counts gives , and therefore the total number of such matrices is .
Tagged Combinations and selections with conditions. Machine-assigned, so read it as a strong shortlist rather than a verdict.