RankRizz
JEE MAIN 2020 · 08 JAN S1+4MEDIUMTRANSCRIBED

JEE Main 2020 Mathematics question — Trace and special matrices

The number of all 3×33 \times 3 matrices A, with entries from the set {−1,0,1}\{-1, 0, 1\} such that the sum of the diagonal elements of AATAA^T is 3, is

SOLUTION

We begin by recalling a standard fact from linear algebra: for any real matrix AA, the trace of the matrix product AATAA^T is equal to the sum of the squares of all the entries of AA. Symbolically, we write

tr⁡(AAT)=∑i=13∑j=13aij2,\operatorname{tr}(AA^T)=\sum_{i=1}^{3}\sum_{j=1}^{3}a_{ij}^2,

where A=(aij)A=(a_{ij}) is our 3×33\times 3 matrix. This happens because the diagonal entry in the ii-th row and ii-th column of AATAA^T is ∑j=13aij2\sum_{j=1}^{3}a_{ij}^2, and adding the three diagonal entries together simply gathers every aij2a_{ij}^2 once.

Now the question demands that the sum of the diagonal elements of AATAA^T be 33. Using the equality just stated, we translate that requirement into a very concrete arithmetic condition:

∑i=13∑j=13aij2=3.\sum_{i=1}^{3}\sum_{j=1}^{3}a_{ij}^2=3.

Next, we look at the allowed values of each entry aija_{ij}. Every entry must come from the set {−1,0,1}\{-1,0,1\}. We immediately notice

(−1)2=1,02=0,12=1.(-1)^2 = 1,\qquad 0^2 = 0,\qquad 1^2 = 1.

So each individual square is either 00 or 11, and never anything else. Therefore, the total sum of all nine squares can only equal the count of how many entries are non-zero. To make that sum equal to 33, we must have

• exactly three entries of AA equal to either 11 or −1-1 (since each such entry contributes 11 to the sum), and
• the remaining six entries equal to 00 (since 02=00^2=0 contributes nothing).

Thus, our task converts to a purely combinatorial counting problem: choose any three positions in the 3×33\times3 grid to hold the non-zero numbers, and then decide independently for each chosen position whether the non-zero number is 11 or −1-1.

First, we count the ways to choose the positions. There are 99 positions altogether, and we want any 33 of them, so by the binomial coefficient formula we have

(93)=9×8×73×2×1=84.\binom{9}{3}= \frac{9\times8\times7}{3\times2\times1}=84.

Second, after fixing those three positions, each one can carry either 11 or −1-1. The two choices are independent for the three spots, giving in total

23=82^3 = 8

sign assignments.

Finally, by the multiplication principle of counting, we multiply the two independent counts:

(93)×23=84×8=672.\binom{9}{3}\times 2^3 = 84 \times 8 = 672.

Therefore, there are exactly 672672 matrices satisfying the given condition.

So, the answer is 672672.

Tagged Trace and special matrices. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicTrace and special matrices
TypeNumerical answer