24
Step 1: Interpret the conditions We are told: - \( Q^{-1} = Q^T \) $\Rightarrow $ \( Q \) is an orthogonal matrix
. - \( Q \) is invertible with integer entries $\Rightarrow$ entries must be from \(−1, 0, 1\).
- \( PQ = QP \) $\Rightarrow$ \( Q \) commutes with the diagonal matrix \( P \).
Step 2: Structure of \( Q \) The matrix \( P \) has eigenvalues 2, 2, and 3. This means the eigenspace corresponding to 2 is 2-dimensional (spanned by standard basis vectors \( e_1, e_2 \)), and the eigenspace corresponding to 3 is 1-dimensional (spanned by \( e_3 \)).
Since \( Q \) must commute with \( P \), it must preserve these eigenspaces. So \( Q \) must be of the form: \[ Q = \begin{pmatrix} Q_1 & 0
0 & \pm 1 \end{pmatrix} \] where \( Q_1 \) is a \( 2 \times 2 \) orthogonal matrix with integer entries.
Step 3: Count such matrices The number of \( 2 \times 2 \) orthogonal matrices over integers is 4 (rotations and reflections in 2D with integer entries): - Identity, swap rows, sign flips, etc. And for the bottom-right corner (\( \pm1 \)), we have 2 choices. So total number of such matrices: \[ 4 \times 2 = \boxed{8} \]
Let \(f(x)=x+log_{e}x−xlog_{e}x,\text{ }x∈(0,∞)\).
List-I | List-II | ||
|---|---|---|---|
| (I) | If \(\frac{q}{r}=10\), then the system of linear equations has | (P) | x = 0, \(y=\frac{10}{9},z=-\frac{1}{9}\) as a solution |
| (II) | If \(\frac{p}{r}≠100\), then the system of linear equations has | (Q) | \(x=\frac{10}{9},y=\frac{-1}{9},z=0\) as a solution |
| (III) | If \(\frac{p}{q}≠10,\) then the system of linear equations has | (R) | infinitely many solutions |
| (IV) | If \(\frac{p}{q}=10,\) then the system of linear equations has | (S) | no solution |
| (T) | at least one solution | ||