RankRizz
JEE MAIN 2012TRANSCRIBED

JEE Main 2012 Mathematics question — Counting matrices with given properties

If ATA^T denotes the transpose of the matrix A=[00a0bcdef]A = \begin{bmatrix} 0 & 0 & a \\ 0 & b & c \\ d & e & f \end{bmatrix}, where a,b,c,d,ea, b, c, d, e and ff are integers such that abd≠0abd \neq 0, then the number of such matrices for which A−1=ATA^{-1} = A^T is

SOLUTION

Condition A−1=ATA^{-1}=A^{T} means that AA is an orthogonal matrix, i.e. AAT=ATA=I3AA^{T}=A^{T}A=I_{3}. In an orthogonal matrix, every row (and every column) is a unit vector that is orthogonal to the other two rows (or columns).

Because all entries are integers, a unit vector can contain only 0, 1,  ⁣−10,\,1,\,\! -1; moreover exactly one entry must be ±1\pm1 and the others must be 00. (Otherwise its squared length would exceed 11.) Thus every row of AA is a “signed” standard basis vector.

Write the given matrix as A=[00a0bcdef],A=\begin{bmatrix} 0 & 0 & a \\ 0 & b & c \\ d & e & f \end{bmatrix}, with a,b,d≠0a,b,d\neq0. Since the non-zero entries can only be ±1\pm1 we already have a,b,d∈{±1}a,b,d\in\{\pm1\}.

Step 1: Orthogonality of row 1 and row 2
Row 1 is [ 0,  0,  a ][\,0,\;0,\;a\,], Row 2 is [ 0,  b,  c ][\,0,\;b,\;c\,]. Their dot product must vanish: 0⋅0+0⋅b+a⋅c=a c=0  0\cdot0+0\cdot b+a\cdot c=a\,c=0\;, so c=0c=0.

Step 2: Orthogonality of row 1 and row 3
Row 3 is [ d,  e,  f ][\,d,\;e,\;f\,]. Dotting with Row 1 gives 0⋅d+0⋅e+a⋅f=a f=0  0\cdot d+0\cdot e+a\cdot f=a\,f=0\;, hence f=0f=0.

Step 3: Orthogonality of row 2 and row 3
Row 2 is now [ 0,  b,  0 ][\,0,\;b,\;0\,]. Their dot product is 0⋅d+b⋅e+0⋅0=b e=0  0\cdot d+b\cdot e+0\cdot0=b\,e=0\;, so e=0e=0.

Step 4: Unit-length of each row
Row 1 already has squared length a2=1a^{2}=1 (since a=±1a=\pm1).
Row 2 has squared length b2=1b^{2}=1 (since b=±1b=\pm1).
Row 3 has squared length d2=1d^{2}=1 (since d=±1d=\pm1).
Thus all rows are unit vectors and pairwise orthogonal, satisfying orthogonality completely.

After these deductions the matrix must be

A=[00a0b0d00],where a,b,d∈{±1}.A=\begin{bmatrix} 0 & 0 & a \\[4pt] 0 & b & 0 \\[4pt] d & 0 & 0 \end{bmatrix}, \qquad\text{where } a,b,d\in\{\pm1\}.

Step 5: Counting the matrices
Each of a, b, da,\,b,\,d can independently take two values (+1+1 or −1-1). Hence the total number of admissible matrices is 2×2×2=23=82\times2\times2=2^{3}=8.

Therefore the required number of matrices is 23=82^{3} = 8.

Option C which is: 232^{3}

Tagged Counting matrices with given properties. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicCounting matrices with given properties
TypeMultiple choice