RankRizz
JEE MAIN 2022 · 27 JUL S1+4 / −1MEDIUMTRANSCRIBED

JEE Main 2022 Mathematics question — Counting matrices with given properties

Let SS be the set containing all 3×33 \times 3 matrices with entries from {−1,0,1}\{-1, 0, 1\}. The total number of matrices A∈SA \in S such that the sum of all the diagonal elements of ATAA^T A is 66 is

SOLUTION

For any real matrix AA, the transpose-product ATAA^{T}A is always square and its trace equals the sum of the squares of all entries of AA.

Formally, for a 3×33 \times 3 matrix A=[aij]A=[a_{ij}],

trace⁡(ATA)=∑k=13(ATA)kk=∑k=13∑i=13aik2=∑i=13∑k=13aik2\operatorname{trace}(A^{T}A)=\sum_{k=1}^{3}(A^{T}A)_{kk} =\sum_{k=1}^{3}\sum_{i=1}^{3}a_{ik}^{2} =\sum_{i=1}^{3}\sum_{k=1}^{3}a_{ik}^{2}

Thus, the given condition “the sum of the diagonal elements of ATAA^{T}A is 66” is equivalent to

∑i=13∑k=13aik2=6\sum_{i=1}^{3}\sum_{k=1}^{3}a_{ik}^{2}=6

The entries of AA are taken from {−1, 0, 1}\{-1,\,0,\,1\}, so each squared entry is either 00 or 11. Therefore the total number of non-zero (±1) entries must be exactly 66, because each contributes 11 to the sum and we need the sum to be 66.

Step 1 — choose the positions of the six non-zero entries:
There are 99 positions in a 3×33 \times 3 matrix. Selecting any 66 of them gives (96)=84\binom{9}{6}=84 possibilities.

Step 2 — assign a sign (1 or -1) to each chosen position:
Each of the 66 selected positions can independently be 11 or −1-1, giving 26=642^{6}=64 sign patterns.

Step 3 — multiply the counts:
Total number of admissible matrices =84×64=5376= 84 \times 64 = 5376.

Hence, the number of matrices A∈SA \in S satisfying the given condition is 5376\mathbf{5376}.

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

TopicCounting matrices with given properties
TypeNumerical answer