Let M$M$ denote the set of all real matrices of order 3 times 3$3 \times 3$ and let S = \-3, -2, -1, 1, 2\$S = \{-3, -2, -1, 1, 2\}$. Let
S_1 = left\A = left[ a_ij right] in M: A = A^T text and a_ij in S, forall i, j right\$$S_1 = \left\{A = \left[ a_{ij} \right] \in M: A = A^T \text{ and } a_{ij} \in S, \forall i, j \right\}$$S_2 = left\A = left[ a_ij right] in M: A = -A^T text and a_ij in S, forall i, j right\$$S_2 = \left\{A = \left[ a_{ij} \right] \in M: A = -A^T \text{ and } a_{ij} \in S, \forall i, j \right\}$$S_3 = left\A = left[ a_ij right] in M: a_11 + a_22 + a_33 = 0 text and a_ij in S, forall i, j right\$$S_3 = \left\{A = \left[ a_{ij} \right] \in M: a_{11} + a_{22} + a_{33} = 0 \text{ and } a_{ij} \in S, \forall i, j \right\}$$
If n(S_1 cup S_2 cup S_3) = 125alpha$n(S_1 \cup S_2 \cup S_3) = 125\alpha$, then alpha$\alpha$ equals.
Numerical Answer Type:
Enter a numerical valueAnswer: 1613 to 1613+4 marks
Solution & Explanation
### Related Formula
Set Principle of Inclusion-Exclusion:
n(S_1 cup S_2 cup S_3) = n(S_1) + n(S_2) + n(S_3) - n(S_1 cap S_2) - n(S_2 cap S_3) - n(S_1 cap S_3) + n(S_1 cap S_2 cap S_3)$$n(S_1 \cup S_2 \cup S_3) = n(S_1) + n(S_2) + n(S_3) - n(S_1 \cap S_2) - n(S_2 \cap S_3) - n(S_1 \cap S_3) + n(S_1 \cap S_2 \cap S_3)$$
### Core Logic
Let's count each subset based on the 5 elements available in S$S$:
1. For S_1$S_1$ (Symmetric matrices): 6 independent element choices implies n(S_1) = 5^6$\implies n(S_1) = 5^6$.
2. For S_2$S_2$ (Skew-symmetric matrices): Diagonal elements must be 0, but 0 notin S$0 \notin S$, so n(S_2) = 0$n(S_2) = 0$.
Since n(S_2) = 0$n(S_2) = 0$, any intersection term involving S_2$S_2$ also becomes 0.
### Step 1: Calculating Trace Matrix Variations
For S_3$S_3$ (Trace equal to zero conditions):
The condition a_11 + a_22 + a_33 = 0$a_{11} + a_{22} + a_{33} = 0$ over S = \-3, -2, -1, 1, 2\$S = \{-3, -2, -1, 1, 2\}$ has exactly 12 valid tuple combinations. The remaining 6 elements can be chosen freely.
n(S_3) = 12 times 5^6$$n(S_3) = 12 \times 5^6$$
For the intersection n(S_1 cap S_3)$n(S_1 \cap S_3)$:
n(S_1 cap S_3) = 12 times 5^3$$n(S_1 \cap S_3) = 12 \times 5^3$$
### Step 2: Final Inclusion-Exclusion Assembly
n(S_1 cup S_2 cup S_3) = 5^6 + 12 times 5^6 - 12 times 5^3$$n(S_1 \cup S_2 \cup S_3) = 5^6 + 12 \times 5^6 - 12 \times 5^3$$= 5^3 times [13 times 5^3 - 12] = 125 times 1613$$= 5^3 \times [13 \times 5^3 - 12] = 125 \times 1613$$
Thus, alpha = 1613$\alpha = 1613$.
### Pattern Recognition
Always check if the set contains 0$0$. Missing zero elements in skew-symmetric matrix setups instantly zeros out large blocks of permutations.
### Evaluation Rubric / Model Answer
null
### Chapter Mix
Class 12 Maths: Matrices and Determinants
Keywords:#number of symmetric and skew symmetric matrices#JEE Main 2025 Morning Q71#Matrices and Determinants JEE Main 2025#Symmetric and Skew Symmetric Matrices JEE Main 2025
More Matrices and Determinants Previous-Year Questions
Q58jee_main_2025_02_april_eveningSystem of Linear Equations
If the system of equations
beginaligned 2x + lambda y + 3z &= 5 \\ 3x + 2y - z &= 7 \\ 4x + 5y + mu z &= 9 endaligned$$\begin{aligned} 2x + \lambda y + 3z &= 5 \\ 3x + 2y - z &= 7 \\ 4x + 5y + \mu z &= 9 \end{aligned}$$
has infinitely many solutions, then (lambda^2 + mu^2)$(\lambda^2 + \mu^2)$ is equal to:
A. 22
B. 18
C. 26
D. 30
Solution
### Related Formula
textFor infinitely many solutions: Delta = 0 quad textand quad Delta_i = 0$$\text{For infinitely many solutions: } \Delta = 0 \quad \text{and} \quad \Delta_i = 0$$
### Core Logic
For a system of 3 linear equations to have infinitely many solutions, the determinant of coefficients and all Cramer determinants must equal zero.
### Step 1: Set up determinant equations
The determinant of coefficients is:
Delta = beginvmatrix 2 & lambda & 3 \\ 3 & 2 & -1 \\ 4 & 5 & mu endvmatrix = 0$$\Delta = \begin{vmatrix} 2 & \lambda & 3 \\ 3 & 2 & -1 \\ 4 & 5 & \mu \end{vmatrix} = 0$$2(2mu + 5) - lambda(3mu + 4) + 3(15 - 8) = 0$$2(2\mu + 5) - \lambda(3\mu + 4) + 3(15 - 8) = 0$$4mu + 10 - 3lambdamu - 4lambda + 21 = 0$$4\mu + 10 - 3\lambda\mu - 4\lambda + 21 = 0$$4mu - 3lambdamu - 4lambda + 31 = 0 quad text--- (1)$$4\mu - 3\lambda\mu - 4\lambda + 31 = 0 \quad \text{--- (1)}$$
Now, set Delta_3 = 0$\Delta_3 = 0$:
Delta_3 = beginvmatrix 2 & lambda & 5 \\ 3 & 2 & 7 \\ 4 & 5 & 9 endvmatrix = 0$$\Delta_3 = \begin{vmatrix} 2 & \lambda & 5 \\ 3 & 2 & 7 \\ 4 & 5 & 9 \end{vmatrix} = 0$$2(18 - 35) - lambda(27 - 28) + 5(15 - 8) = 0$$2(18 - 35) - \lambda(27 - 28) + 5(15 - 8) = 0$$-34 + lambda + 35 = 0 implies lambda = -1$$-34 + \lambda + 35 = 0 \implies \lambda = -1$$
### Step 2: Solve for mu and compute the sum of squares
Substitute lambda = -1$\lambda = -1$ into equation (1):
4mu - 3(-1)mu - 4(-1) + 31 = 0$$4\mu - 3(-1)\mu - 4(-1) + 31 = 0$$4mu + 3mu + 4 + 31 = 0$$4\mu + 3\mu + 4 + 31 = 0$$7mu = -35 implies mu = -5$$7\mu = -35 \implies \mu = -5$$
Now calculate the sum of squares:
lambda^2 + mu^2 = (-1)^2 + (-5)^2 = 1 + 25 = 26$$\lambda^2 + \mu^2 = (-1)^2 + (-5)^2 = 1 + 25 = 26$$
### Pattern Recognition
Whenever you need to solve for two variables in Cramer's theorem, identifying which determinant lacks the complex variable (like Delta_3$\Delta_3$ which lacks mu$\mu$) is the fastest way to solve for one variable independently.
### Evaluation Rubric / Model Answer
null
### Chapter Mix
Class 12 Mathematics: Matrices and Determinants
Q70jee_main_2025_02_april_eveningProperties of Matrices
Let A be a 3 times 3$3 \times 3$ real matrix such that mathrmA^2 (mathrmA - 2mathrmI) - 4(mathrmA - mathrmI) = mathrmO$\mathrm{A}^2 (\mathrm{A} - 2\mathrm{I}) - 4(\mathrm{A} - \mathrm{I}) = \mathrm{O}$, where I and O are the identity and null matrices, respectively. If mathrmA^5 = alpha mathrmA^2 + beta mathrmA + gamma mathrmI$\mathrm{A}^5 = \alpha \mathrm{A}^2 + \beta \mathrm{A} + \gamma \mathrm{I}$, where alpha, beta$\alpha, \beta$ and gamma$\gamma$ are real constants, then alpha + beta + gamma$\alpha + \beta + \gamma$ is equal to:
A. 12
B. 20
C. 76
D. 4
Solution
### Related Formula
textCharacteristic equation reduction: mathrmA^3 = 2mathrmA^2 + 4mathrmA - 4mathrmI$$\text{Characteristic equation reduction: } \mathrm{A}^3 = 2\mathrm{A}^2 + 4\mathrm{A} - 4\mathrm{I}$$
### Core Logic
We use the given cubic matrix equation recursively to express the fifth power of matrix A$A$ solely in terms of quadratic and linear terms.
### Step 1: Simplify the cubic matrix equation
The given equation is:
mathrmA^2 (mathrmA - 2mathrmI) - 4(mathrmA - mathrmI) = mathrmO$$\mathrm{A}^2 (\mathrm{A} - 2\mathrm{I}) - 4(\mathrm{A} - \mathrm{I}) = \mathrm{O}$$mathrmA^3 - 2mathrmA^2 - 4mathrmA + 4mathrmI = mathrmO implies mathrmA^3 = 2mathrmA^2 + 4mathrmA - 4mathrmI$$\mathrm{A}^3 - 2\mathrm{A}^2 - 4\mathrm{A} + 4\mathrm{I} = \mathrm{O} \implies \mathrm{A}^3 = 2\mathrm{A}^2 + 4\mathrm{A} - 4\mathrm{I}$$
Multiply by matrix A$A$ to find the fourth power:
mathrmA^4 = 2mathrmA^3 + 4mathrmA^2 - 4mathrmA$$\mathrm{A}^4 = 2\mathrm{A}^3 + 4\mathrm{A}^2 - 4\mathrm{A}$$
### Step 2: Reduce the fourth power term
Substitute the expression for mathrmA^3$\mathrm{A}^3$ into our formula for mathrmA^4$\mathrm{A}^4$:
mathrmA^4 = 2left( 2mathrmA^2 + 4mathrmA - 4mathrmI right) + 4mathrmA^2 - 4mathrmA$$\mathrm{A}^4 = 2\left( 2\mathrm{A}^2 + 4\mathrm{A} - 4\mathrm{I} \right) + 4\mathrm{A}^2 - 4\mathrm{A}$$mathrmA^4 = 4mathrmA^2 + 8mathrmA - 8mathrmI + 4mathrmA^2 - 4mathrmA = 8mathrmA^2 + 4mathrmA - 8mathrmI$$\mathrm{A}^4 = 4\mathrm{A}^2 + 8\mathrm{A} - 8\mathrm{I} + 4\mathrm{A}^2 - 4\mathrm{A} = 8\mathrm{A}^2 + 4\mathrm{A} - 8\mathrm{I}$$
Multiply by matrix A$A$ to find the fifth power:
mathrmA^5 = 8mathrmA^3 + 4mathrmA^2 - 8mathrmA$$\mathrm{A}^5 = 8\mathrm{A}^3 + 4\mathrm{A}^2 - 8\mathrm{A}$$
### Step 3: Reduce the fifth power term and solve
Substitute the expression for mathrmA^3$\mathrm{A}^3$ again:
mathrmA^5 = 8left( 2mathrmA^2 + 4mathrmA - 4mathrmI right) + 4mathrmA^2 - 8mathrmA$$\mathrm{A}^5 = 8\left( 2\mathrm{A}^2 + 4\mathrm{A} - 4\mathrm{I} \right) + 4\mathrm{A}^2 - 8\mathrm{A}$$mathrmA^5 = 16mathrmA^2 + 32mathrmA - 32mathrmI + 4mathrmA^2 - 8mathrmA = 20mathrmA^2 + 24mathrmA - 32mathrmI$$\mathrm{A}^5 = 16\mathrm{A}^2 + 32\mathrm{A} - 32\mathrm{I} + 4\mathrm{A}^2 - 8\mathrm{A} = 20\mathrm{A}^2 + 24\mathrm{A} - 32\mathrm{I}$$
Comparing this with mathrmA^5 = alpha mathrmA^2 + beta mathrmA + gamma mathrmI$\mathrm{A}^5 = \alpha \mathrm{A}^2 + \beta \mathrm{A} + \gamma \mathrm{I}$, we find:
- alpha = 20$\alpha = 20$
- beta = 24$\beta = 24$
- gamma = -32$\gamma = -32$
Sum the coefficients:
alpha + beta + gamma = 20 + 24 - 32 = 12$$\alpha + \beta + \gamma = 20 + 24 - 32 = 12$$
### Pattern Recognition
Cayley-Hamilton reduction: For any polynomial equation of a matrix, higher powers A^k$A^k$ can always be reduced down to polynomials of order less than the degree of the characteristic equation by recursive substitution.
### Evaluation Rubric / Model Answer
null
### Chapter Mix
Class 12 Mathematics: Matrices and Determinants
Qjee_main_2025_02_april_morningSystem of Linear Equations
If the system of linear equations
3x + y + beta z = 3$$3x + y + \beta z = 3$$2x + alpha y - z = -3$$2x + \alpha y - z = -3$$x + 2y + z = 4$x + 2y + z = 4$
has infinitely many solutions, then the value of 22beta - 9alpha$22\beta - 9\alpha$ is:
A.49$49$
B.31$31$
C.43$43$
D.37$37$
Solution
### Related Formula
Cramer's Rule for infinite solutions specifies that the main determinant and all component determinants must vanish:
Delta = 0 quad textand quad Delta_1 = Delta_2 = Delta_3 = 0$$\Delta = 0 \quad \text{and} \quad \Delta_1 = \Delta_2 = \Delta_3 = 0$$
### Core Logic
Set the key system determinants to zero to form equations linking alpha$\alpha$ and beta$\beta$, then isolate the constants.
### Step 1: Set Main Determinant to Zero
Delta = beginvmatrix 3 & 1 & beta \\ 2 & alpha & -1 \\ 1 & 2 & 1 endvmatrix = 0$$\Delta = \begin{vmatrix} 3 & 1 & \beta \\ 2 & \alpha & -1 \\ 1 & 2 & 1 \end{vmatrix} = 0$$
Expand along the first row:
3(alpha + 2) - 1(2 + 1) + beta(4 - alpha) = 0$$3(\alpha + 2) - 1(2 + 1) + \beta(4 - \alpha) = 0$$3alpha + 6 - 3 + 4beta - alphabeta = 0 implies 3alpha + 4beta - alphabeta + 3 = 0 quad dots (1)$$3\alpha + 6 - 3 + 4\beta - \alpha\beta = 0 \implies 3\alpha + 4\beta - \alpha\beta + 3 = 0 \quad \dots (1)$$
### Step 2: Set Subsidiary Determinant to Zero
Using Delta_3 = 0$\Delta_3 = 0$ by substituting the constants vector into the third column:
Delta_3 = beginvmatrix 3 & 1 & 3 \\ 2 & alpha & -3 \\ 1 & 2 & 4 endvmatrix = 0$$\Delta_3 = \begin{vmatrix} 3 & 1 & 3 \\ 2 & \alpha & -3 \\ 1 & 2 & 4 \end{vmatrix} = 0$$
Expand along the first row:
3(4alpha + 6) - 1(8 + 3) + 3(4 - alpha) = 0$$3(4\alpha + 6) - 1(8 + 3) + 3(4 - \alpha) = 0$$12alpha + 18 - 11 + 12 - 3alpha = 0 implies 9alpha + 19 = 0 implies alpha = -frac199$$12\alpha + 18 - 11 + 12 - 3\alpha = 0 \implies 9\alpha + 19 = 0 \implies \alpha = -\frac{19}{9}$$
### Step 3: Solve for Beta and Final Expression
Substitute alpha = -frac199$\alpha = -\frac{19}{9}$ into equation (1):
3left(-frac199right) + 4beta - left(-frac199right)beta + 3 = 0$$3\left(-\frac{19}{9}\right) + 4\beta - \left(-\frac{19}{9}\right)\beta + 3 = 0$$-frac193 + 3 + betaleft(4 + frac199right) = 0 implies -frac103 + betaleft(frac559right) = 0$$-\frac{19}{3} + 3 + \beta\left(4 + \frac{19}{9}\right) = 0 \implies -\frac{10}{3} + \beta\left(\frac{55}{9}\right) = 0$$frac559beta = frac103 implies beta = frac103 cdot frac955 = frac611$$\frac{55}{9}\beta = \frac{10}{3} \implies \beta = \frac{10}{3} \cdot \frac{9}{55} = \frac{6}{11}$$
Now compute 22beta - 9alpha$22\beta - 9\alpha$:
22left(frac611right) - 9left(-frac199
ight) = 12 + 19 = 31$$22\left(\frac{6}{11}\right) - 9\left(-\frac{19}{9}
ight) = 12 + 19 = 31$$
### Pattern Recognition
Choosing Delta_3$\Delta_3$ over Delta_1$\Delta_1$ or Delta_2$\Delta_2$ eliminates beta$\beta$ entirely because the variable parameters are localized in specific positions. This yields alpha$\alpha$ directly without requiring a coupled system solution.
### Evaluation Rubric / Model Answer
null
### Chapter Mix
Class 12 Mathematics: Matrices and Determinants
More Matrices and Determinants Questions — jee_main_2025_28_jan_morning
We Map Every Repeating Question in Competitive Exams.
Say goodbye to generic mock test fatigue. RankBit uses smart analysis to group past exam questions into their foundational Repeating Question Types. Find chapter weightage, track repeating questions, and score higher with targeted practice.
Select Your Target Exam
Choose an exam track below to find formulas per chapter and patterns.
Syncing Exam Intelligence
Mapping formulas and patterns across all tracks…
PATH A — FULL LENGTH PRACTICE
Full Mock Test Hub
Simulate real NTA exam conditions with fully tracked mocks. Time yourself against past papers.
Practice past-year questions one chapter at a time. Pick an exam → subject → chapter and get every PYQ for that topic — pulled together from all past papers — with the chapter's key formulas alongside.