Let p be an odd prime number and Tp be the following set of 2*2 matrices. Tp= { A= [a11 =a ,a12=b,a21=c,a22=a] } a,b,c€{0,1,...,p-1} The number of a in Tp such that trace of A is not divisible by p but det A is divisible by p is
The number of A in Tp is there in the second last line instead of the number of a in Tp.
@ganeshie8
whats the trace of A ?
2a
\(a,b,c\in \{0,1,2,\ldots,p-1\}\) We don't want \(2a\) to be divisible by \(p\). How many integers in the given set satisfy this requirement ?
All of them since p is an odd prime number.
2a won't b divisible by an odd prime number for any value attained by a.
Except for one value that is 0.
Is a is 0 then it is divisible by p.
If*
Good. So we see that there are \(p-1\) choices for \(a\) that satisfy the first condition. Lets look at second condition.
whats the determinant of A ?
a^2-bc
Yes, lets prove a little lemma first.
Consider the complete set of residues mod \(p\) \[\{0,1,2,\ldots,p-1\}\] If \(\gcd(b,p)=1\), then below set also forms a complete set of residues mod \(p\) \[\{0*a,1*a,2*a,\ldots,(p-1)*a\}\]
Residues mod p? Does it mean that all the values that a,b,c can attain?
for example, let \(p=5\). The complete set of residues mod \(5\) are \[\{0,1,2,3,4\}\]. Let \(a=3\), then below set also forms the complete residue set mod \(5\) \[\{0*3,1*3,2*3,3*3,4*4\}\]
residue is same as remainder
simplify the remainders in the last set and convince yourself you indeed get the set \(\{0,1,2,3,4\}\)
Okay!
Are you there? @ganeshie Sir
Join our real-time social learning platform and learn together with your friends!