RankRizz
JEE MAIN 2022 · 25 JUL S1+4 / −1HARDTRANSCRIBED

JEE Main 2022 Mathematics question — Types of matrices and matrix algebra

Let A=(2−1−110−11−10)A = \begin{pmatrix} 2 & -1 & -1 \\ 1 & 0 & -1 \\ 1 & -1 & 0 \end{pmatrix} and B=A−IB = A - I. If ω=3i−12\omega = \dfrac{\sqrt{3}i - 1}{2}, then the number of elements in the set {n∈{1,2,…,100}:An+(ωB)n=A+B}\{n \in \{1, 2, \ldots, 100\} : A^n + (\omega B)^n = A + B\} is equal to ______.

SOLUTION

Given A=(2−1−110−11−10)A = \begin{pmatrix} 2 & -1 & -1 \\ 1 & 0 & -1 \\ 1 & -1 & 0 \end{pmatrix}, B=A−IB = A - I, and ω=3i−12\omega = \dfrac{\sqrt{3}i - 1}{2}. Find the number of n∈{1,2,…,100}n \in \{1, 2, \ldots, 100\} such that An+(ωB)n=A+BA^n + (\omega B)^n = A + B.

Subtracting the identity matrix from AA gives:

B=(1−1−11−1−11−1−1)B = \begin{pmatrix} 1 & -1 & -1 \\ 1 & -1 & -1 \\ 1 & -1 & -1 \end{pmatrix}

Since every row of BB is (1,−1,−1)(1, -1, -1), the matrix BB has rank 1.

Multiplying BB by itself yields:

B2=(1−1−11−1−11−1−1)(1−1−11−1−11−1−1)=(−111−111−111)=−BB^2 = \begin{pmatrix} 1 & -1 & -1 \\ 1 & -1 & -1 \\ 1 & -1 & -1 \end{pmatrix}\begin{pmatrix} 1 & -1 & -1 \\ 1 & -1 & -1 \\ 1 & -1 & -1 \end{pmatrix} = \begin{pmatrix} -1 & 1 & 1 \\ -1 & 1 & 1 \\ -1 & 1 & 1 \end{pmatrix} = -B

Thus B2=−BB^2 = -B, which implies B3=BB^3 = B. More generally, Bn=BB^n = B if nn is odd and Bn=−BB^n = -B if nn is even (for n≥1n \ge 1).

Using the relation A=I+BA = I + B together with B2=−BB^2 = -B, we compute:

A2=(I+B)2=I+2B+B2=I+2B−B=I+B=AA^2 = (I + B)^2 = I + 2B + B^2 = I + 2B - B = I + B = A

Therefore A2=AA^2 = A, and by induction An=AA^n = A for all n≥1n \ge 1.

Considering (ωB)n(\omega B)^n, we note that:

(ωB)n=ωnBn(\omega B)^n = \omega^n B^n

When nn is odd, Bn=BB^n = B so (ωB)n=ωnB(\omega B)^n = \omega^n B.

When nn is even, Bn=−BB^n = -B so (ωB)n=−ωnB(\omega B)^n = -\omega^n B.

Substituting into the equation An+(ωB)n=A+BA^n + (\omega B)^n = A + B and using An=AA^n = A leads to:

A+(ωB)n=A+BA + (\omega B)^n = A + B (ωB)n=B(\omega B)^n = B

In the case of odd nn, this requires ωnB=B  ⟹  ωn=1\omega^n B = B \implies \omega^n = 1.

In the case of even nn, it requires −ωnB=B  ⟹  ωn=−1-\omega^n B = B \implies \omega^n = -1.

Since ω=−1+3i2=ei⋅2π/3\omega = \dfrac{-1 + \sqrt{3}i}{2} = e^{i\cdot 2\pi/3} is a primitive cube root of unity, we have ω3=1\omega^3 = 1.

For odd nn, the condition ωn=1\omega^n = 1 implies n≡0(mod3)n \equiv 0 \pmod{3}, and combined with oddness gives n≡3(mod6)n \equiv 3 \pmod{6}.

Within the set {1,…,100}\{1, \ldots, 100\}, these values are n=3,9,15,…,99n = 3, 9, 15, \ldots, 99, whose number is 99−36+1=17\dfrac{99 - 3}{6} + 1 = 17.

For even nn, there is no solution because ωn\omega^n can only be 1,ω,ω21, \omega, \omega^2, none of which equals −1-1.

Hence there are 17 such values of nn.

Tagged Types of matrices and matrix algebra. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicTypes of matrices and matrix algebra
TypeNumerical answer