Let be a matrix of order , whose entries are from the set . If the sum of all the entries of is a prime number , then the number of such matrices is ______
We need to count matrices with entries from whose entry sum is a prime with .
The primes in the range are .
We need the number of solutions to where .
Case 1:
Without the upper bound constraint, the number of non-negative integer solutions is .
Since no variable can exceed 3 when the sum is 3, all solutions satisfy the upper bound. Count = 20.
Case 2:
Unrestricted: .
Since the sum is 5, no single variable can exceed 5, so the upper bound constraint is automatically satisfied. Count = 56.
Case 3:
Unrestricted: .
Subtract cases where any variable : if , let , then , giving solutions.
By symmetry across all 4 variables: subtract .
Count = .
Total:
The correct answer is .
Tagged Combinations and selections with conditions. Machine-assigned, so read it as a strong shortlist rather than a verdict.