Let , where , and . Let and I be the identity matrix of order 2. Then the total number of ordered pairs for which is
Here,
Given,
and
Since, r {1, 2, 3} and (1)r + 1 = 0
r = {1, 3}
Also,
If r = 1, then
which is only possible, when s = 1.
As,
r = 1, s = 1
Again, if r = 3, then
[never possible]
r 3
(r, s) = (1, 1) is the only solution.
Hence, the total number of ordered pairs is 1.
Tagged Types of matrices and matrix algebra. Machine-assigned, so read it as a strong shortlist rather than a verdict.