Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.
Paste your question to our Mathbee AI Mentor below to get an instant step-by-step solution.
Let $$S = \left\{ {\left( {\matrix{ { - 1} & a \cr 0 & b \cr } } \right);a,b \in \{ 1,2,3,....100\} } \right\}$$ and let $${T_n} = \{ A \in S:{A^{n(n + 1)}} = I\} $$. Then the number of elements in $$\bigcap\limits_{n = 1}^{100} {{T_n}} $$ is ___________.
Step 1: For A=[ [−1,a],[0,b] ], A²=[ [1,a(b−1)],[0,b²] ]. Since the intersection includes T₁, A²=I is necessary.
Step 2: A²=I requires b²=1 and a(b−1)=0. Because b∈{1,…,100}, b=1, and then the off-diagonal condition holds for every a∈{1,…,100}.
Step 3: For b=1, A²=I and n(n+1) is even for every n, so Aⁿ⁽ⁿ⁺¹⁾=I for all n=1,…,100. Hence there are 100 matrices.
Confused by the solution? Ask the AI to explain a specific step, tell you where you went wrong, or break down the key trap in this question.
Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.