The number of A in , such that det (A) is not divisible byp is
Let be an odd prime number, and consider the set
We want to count the number of matrices whose determinant is not divisible by .
Recall that for
the determinant is
Hence is not divisible by precisely when
Since each range over , there are
total possible matrices in .
It will be easier to first count the number of triples for which
and then subtract that from .
Then . We need
Over the field , the product if and only if at least one of or is (since is prime).
If , then can be anything in .
This gives possibilities.
If , then can be anything in .
This also gives possibilities.
However, the pair is counted in both cases, so we must subtract it out once.
Hence, for , the number of such that is
Then can be any nonzero element in ; there are such choices. In that scenario, . We want
Over , a nonzero right-hand side can be written as in the following way:
If , then , which cannot equal .
No solutions in that subcase.
If , then for each nonzero there is exactly one satisfying , namely .
Since can be any of the nonzero elements, we get solutions for each nonzero .
Thus, for each , there are pairs . Hence, for values of , the total number of solutions in this case is
Summing these two cases:
Case A : solutions.
Case B : solutions.
Hence the total count of satisfying is
(A classic result: there are exactly solutions to over .)
Since there are total triples , the number that satisfy
is simply
This directly corresponds to matrices whose determinant is .
Hence, the number of matrices in with not divisible by is
The expression matches Option D.
Tagged Properties of determinants. Machine-assigned, so read it as a strong shortlist rather than a verdict.