From problem 2.3.25 in Topics in Algebra, 2$\varepsilon$ by I. N. Herstein:
Let $G$ be the group of all $2 \times 2$ matrices $\left(\begin{array}{c c}a & b \\ c & d\end{array}\right)$ where $ad-bc \ne 0$ and $a,b,c,d$ are integers modulo 3, relative to matrix multiplication. Show that $o(G) = 48$.
I know that $o(G) \le 3^4 = 81$, since $a,b,c,d$ can each take one of 3 values (mod 3). I attempted to tighten this bound by finding the number of matrices such that $ad=bc$ (mod 3):
- Suppose $ad=bc=0$ (mod 3). Then ($a = 0$ or $d = 0$) and ($b = 0$ or $c = 0$), leading to 36 possible values for $(a,b,c,d)$.
- Suppose $ad=bc=1$ (mod 3). Then ($a=d=1$ or $a=d=2$) and ($b=c=1$ or $b=c=2$), leading to 4 possible values for $(a,b,c,d)$.
- Suppose $ad=bc=2$ (mod 3). Then ($(a,d)=(1,2)$ or $(a,d)=(2,1)$) and ($(b,c)=(1,2)$ or $(b,c)=(2,1)$), leading to 4 possible values for $(a,b,c,d)$.
So, there are in total $36+4+4 = 44$ such $\left(\begin{array}{c c}a & b \\ c & d\end{array}\right)$ where $ad-bc=0$ (mod 3). That means there are at most $81-44 = 37$ such $\left(\begin{array}{c c}a & b \\ c & d\end{array}\right)$ where $ad-bc\ne 0$, i.e., $o(G) \le 37$. However, this contradicts the problem. Where did I go wrong? Can someone set me on the right path?