The number of matrices A, which can be formed using the elements of the set {-2, -1 , 0, 1, 2} such that the sum of all the diagonal elements of is 5, is_____
gives so the sum of squares of the six entries must equal 5.
Since each entry’s square lies in corresponding to entries , letting be the number of zeros, the number of entries with absolute value 1, and the number with absolute value 2 yields and whose only nonnegative solutions are and .
In the first case exactly one entry is 0 and five entries are , so there are ways to choose the zero entry and sign choices for the others, giving matrices.
In the second case one entry is , one is , and the remaining four are zero, so choosing the position in ways with 2 sign options and then the position in ways with 2 sign options yields matrices.
Adding these counts gives and therefore the total number of matrices is .
Tagged Trace and special matrices. Machine-assigned, so read it as a strong shortlist rather than a verdict.