The number of A in , suchthat the trace of A is not divisible by p but det (A) is divisible by p is
[Note : The trace of a matrix is the sumofits diagonal entries.]
We have an odd prime . Consider the set
We want to count the number of such matrices that satisfy:
.
Since , this means
Because is an odd prime, is invertible .
Hence if and only if .
Thus the condition
is equivalent to
In other words, must be a nonzero element modulo ; so
.
For the matrix
we have
The condition means
Putting these two pieces together:
is nonzero ().
We must count the number of triples with and .
Range for
Since , there are possible values of .
Condition for given
Since , is also nonzero .
If , then , which would only be equal to if . But since . So gives no solutions.
Similarly, if , then , which again cannot equal the nonzero . So gives no solutions either.
Therefore and must both be nonzero modulo .
Once is chosen to be any nonzero element in , there is a unique . Hence:
For each nonzero (that is, ), there is exactly one satisfying .
Consequently, for each fixed nonzero , the number of -pairs is .
Putting it all together
We have choices for .
For each such , there are pairs satisfying .
Therefore, in total, the number of matrices is
Hence the correct answer matches option C, which is
Tagged Properties of determinants. Machine-assigned, so read it as a strong shortlist rather than a verdict.