To find the number of 3×3 invertible matrices Q with integer entries satisfying Q−1=QT (i.e., QQT=I) and PQ=QP, where
P=200020003,
let the matrix Q be represented as:
Q=q11q21q31q12q22q32q13q23q33.
Evaluating the products PQ and QP:
PQ=2q112q213q312q122q223q322q132q233q33,QP=2q112q212q312q122q222q323q133q233q33.
From the condition PQ=QP, equating corresponding entries yields:
2q13=3q13⟹q13=0,
2q23=3q23⟹q23=0,
3q31=2q31⟹q31=0,
3q32=2q32⟹q32=0.
Thus, Q must be a block diagonal matrix of the form:
Q=(A0T0c)=q11q210q12q22000c,
where A=(q11q21q12q22) is a 2×2 matrix with integer entries, and c∈Z.
Using the condition QQT=I3:
(AAT0T0c2)=(I20T01).
This requires:
-
c2=1⟹c=±1 (2 possible values for c).
-
AAT=I2, meaning A is a 2×2 orthogonal matrix with integer entries:
(q11q21q12q22)(q11q12q21q22)=(1001).
From this, the rows of A are orthonormal vectors with integer components:
q112+q122=1⟹(q11,q12)∈{(1,0),(−1,0),(0,1),(0,−1)}(4 choices).
For each choice of the first row (q11,q12), the second row (q21,q22) must be a unit vector with integer components orthogonal to it:
- If (q11,q12)=(±1,0), then (q21,q22)=(0,±1) (2 choices).
- If (q11,q12)=(0,±1), then (q21,q22)=(±1,0) (2 choices).
Therefore, there are 4×2=8 possible choices for the matrix A.
The total number of such invertible integer matrices Q is:
Total number of matrices Q=(choices for A)×(choices for c)=8×2=16.
Thus, the correct option is (C).