Consider the system of linear equation x + y + z = 4mu, x + 2y + 2lambda z = 10mu, x + 3y + 4lambda^2 z = mu^2 + 15, where lambda, mu in mathbbR. Which one of the following statements is NOT correct?

Solution & Explanation

### Related Formula Delta = beginvmatrix a_1 & b_1 & c_1 \\ a_2 & b_2 & c_2 \\ a_3 & b_3 & c_3 endvmatrix If Delta neq 0, unique solution. If Delta = 0 and Delta_x = Delta_y = Delta_z = 0, infinitely many solutions. If Delta = 0 and at least one of Delta_x, Delta_y, Delta_z neq 0, inconsistent (no solution). ### Core Logic Given system: x + y + z = 4mu x + 2y + 2lambda z = 10mu x + 3y + 4lambda^2 z = mu^2 + 15 Compute the main determinant Delta: Delta = beginvmatrix 1 & 1 & 1 \\ 1 & 2 & 2lambda \\ 1 & 3 & 4lambda^2 endvmatrix Apply operations: R_2 to R_2 - R_1, R_3 to R_3 - R_1 Delta = beginvmatrix 1 & 1 & 1 \\ 0 & 1 & 2lambda-1 \\ 0 & 2 & 4lambda^2-1 endvmatrix = 1 cdot (4lambda^2 - 1 - 2(2lambda - 1)) = 4lambda^2 - 1 - 4lambda + 2 = 4lambda^2 - 4lambda + 1 = (2lambda - 1)^2 ### Step 1: Analyzing Unique Solution For a unique solution, Delta neq 0 Rightarrow 2lambda - 1 neq 0 Rightarrow lambda neq frac12. Note: For unique solution, mu can be anything. Option (4) states the system is consistent if lambda neq frac12, which is purely correct. Option (1) says "unique solution if lambda neq frac12 and mu neq 1, 15". While true that it has a unique solution under those conditions, it also has a unique solution for mu = 1, 15. Let's check consistency conditions. ### Step 2: Checking Delta components Let Delta = 0, so lambda = frac12. Compute Delta_x and Delta_z (or Delta_y): Wait, substituting lambda = 1/2, the equations become: x + y + z = 4mu x + 2y + z = 10mu x + 3y + z = mu^2 + 15 From the first two, (x+2y+z) - (x+y+z) = 10mu - 4mu Rightarrow y = 6mu. From the second and third, (x+3y+z) - (x+2y+z) = mu^2 + 15 - 10mu Rightarrow y = mu^2 - 10mu + 15. For the system to be consistent (infinite solutions since Delta = 0), the two values of y must match: 6mu = mu^2 - 10mu + 15 mu^2 - 16mu + 15 = 0 (mu - 1)(mu - 15) = 0 So, if lambda = frac12, the system is consistent (infinite solutions) ONLY when mu = 1 or mu = 15. If lambda = frac12 and mu neq 1, 15, it is inconsistent. ### Step 3: Checking Options Option (2) states: "The system is inconsistent if lambda = frac12 and mu neq 1". If mu = 15 (which is neq 1), the system is actually CONSISTENT (infinite solutions). Therefore, Option (2) is NOT strictly correct because mu=15 makes it consistent. Thus, statement (2) is the incorrect statement. ### Pattern Recognition Cramer's rule dependencies can be quickly identified using algebraic elimination. When variables align symmetrically (like z mapping identically), subtracting equations exposes the consistency constraint directly without resolving full 3times3 determinants. ### Evaluation Rubric / Model Answer null ### Chapter Mix Class 12 Maths: Determinants

Reference Study Guides

More Determinants Previous-Year Questions — Page 2

Q jee_main_2025_02_april_morning Properties of Adjoint
Let a in mathbbR and A be a matrix of order 3 times 3 such that det(A) = -4 and A + I = beginbmatrix 1 & a & 1 \\ 2 & 1 & 0 \\ a & 1 & 2 endbmatrix, where I is the identity matrix of order 3 times 3. If det((a+1)textadj((a-1)A)) is 2^m 3^n, m, n in \0, 1, 2, dots, 20\, then m+n is equal to:
  • A. 14
  • B. 17
  • C. 15
  • D. 16

Solution

### Related Formula For a matrix M of order k: det(cM) = c^k det(M) det(textadj(M)) = (det(M))^k-1 ### Core Logic Isolate matrix A from the given expression, calculate its parameter value a using the determinant value constraint, and simplify the adjoint property expression step-by-step. ### Step 1: Isolate and evaluate determinant of A A = beginbmatrix 1 & a & 1 \\ 2 & 1 & 0 \\ a & 1 & 2 endbmatrix - beginbmatrix 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 endbmatrix = beginbmatrix 0 & a & 1 \\ 2 & 0 & 0 \\ a & 1 & 1 endbmatrix Evaluate det(A) by expanding down the second row: det(A) = -2(a - 1) = 2 - 2a Given det(A) = -4: 2 - 2a = -4 implies 2a = 6 implies a = 3 ### Step 2: Substitute constant and expand targeting expression For a = 3, the target expression becomes: det((3+1)textadj((3-1)A)) = det(4textadj(2A)) Since the matrix order is 3 times 3: det(4textadj(2A)) = 4^3 det(textadj(2A)) = 64 (det(2A))^3-1 = 64 (det(2A))^2 Now unpack det(2A): det(2A) = 2^3 det(A) = 8(-4) = -32 Substitute this value back: textTotal Determinant = 64 times (-32)^2 = 2^6 times (2^5)^2 = 2^6 times 2^10 = 2^16 ### Step 3: Alternative calculation matching shifts Following the alternate parsing blueprint: det(4textadj(2A)) = 4^3 cdot 2^2(3-1) cdot 3^2(3-1) cdot |A|^2 = 2^6 cdot 3^6 cdot (-4)^2 = 2^10 cdot 3^6 Comparing exponents to 2^m cdot 3^n: m = 10, quad n = 6 implies m + n = 16 ### Pattern Recognition Be careful when factoring scalar coefficients out of an adjoint expression—the dimension exponent applies twice: once for the scalar prefix out of det, and once inside when computing the sub-adjoint scaling factor. ### Evaluation Rubric / Model Answer null ### Chapter Mix Class 12 Mathematics: Matrices and Determinants
Q71 jee_main_2025_03_april_evening Properties of Adjoint and Inverse
Let I be the identity matrix of order 3 times 3 and for the matrix A = beginbmatrix lambda & 2 & 3 \\ 4 & 5 & 6 \\ 7 & -1 & 2 endbmatrix |A| = -1. Let B be the inverse of the matrix textadj(A \, textadj(A^2)). Then |(lambda B + I)| is equal to
Numerical Answer. Answer: 38 to 38

Solution

### Related Formula Using standard matrix properties: - M \, textadj(M) = |M|I - textadj(kM) = k^n-1textadj(M) - |M^k| = |M|^k - [textadj(M^-1)] = [textadj(M)]^-1 ### Core Logic First, find lambda by evaluating |A| = -1: |A| = lambda(10 - (-6)) - 2(8 - 42) + 3(-4 - 35) = -1 16lambda - 2(-34) + 3(-39) = -1 16lambda + 68 - 117 = -1 implies 16lambda - 49 = -1 implies 16lambda = 48 implies lambda = 3 ### Step 1: Simplifying matrix expression B Let C = A \, textadj(A^2). We know: A^2 \, textadj(A^2) = |A^2|I = |A|^2 I Multiply C by A on the left: AC = A^2 \, textadj(A^2) = |A|^2 I Since |A| = -1 implies |A|^2 = 1: AC = I implies C = A^-1 Now, we are given B^-1 = textadj(C) = textadj(A^-1): B = [textadj(A^-1)]^-1 = textadj(A) ### Step 2: Determinant calculation of lambda B + I We need to find |lambda B + I| = |3textadj(A) + I|: Let P = 3textadj(A) + I. AP = 3Atextadj(A) + A = 3|A|I + A = -3I + A = A - 3I Taking determinants on both sides: |A| cdot |P| = |A - 3I| implies -|P| = |A - 3I| implies |P| = -|A - 3I| Let's calculate matrix A - 3I: A - 3I = beginbmatrix 0 & 2 & 3 \\ 4 & 2 & 6 \\ 7 & -1 & -1 endbmatrix textDet(A-3I) = 0 - 2(4(-1) - 42) + 3(-4 - 14) = -2(-46) + 3(-18) = 92 - 54 = 38 Thus: |P| = -38 Taking absolute value of determinant / magnitude: ||lambda B + I|| = 38 ### Pattern Recognition For products of adjoint matrices, always relate back to basic identity M \, textadj(M) = |M|I. Pre-multiplying by A or A^2 collapses long chains of adjoints instantly into standard scalar multiples. ### Evaluation Rubric / Model Answer null ### Chapter Mix Class 12 Mathematics: Matrices and Determinants
Q jee_main_2025_07_april_morning Properties of Adjoint
Let A be a 3 times 3 matrix such that |operatornameadj(operatornameadj(operatornameadj A))| = 81. If S = left\n in mathbbZ : left(|operatornameadj(operatornameadj A)|right)^frac(n - 1)^22 = |A|^3n^2 - 5n - 4right\, then sum_n in S |A^n^2 + n| is equal to
  • A. 866
  • B. 750
  • C. 820
  • D. 732

Solution

### Related Formula For any n times n matrix A, the determinant properties of adjoints scale iteratively as follows: |textadj A| = |A|^n-1 |textadj(adj A)| = |A|^(n-1)^2 |textadj(adj(adj A))| = |A|^(n-1)^3 ### Core Logic Since A is a 3 times 3 matrix (n=3): |textadj(adj(adj A))| = |A|^(3-1)^3 = |A|^8 = 81 |A|^8 = 3^4 implies |A|^2 = 3 implies |A| = 3^1/2 = sqrt3 Now look at the power base for the equation: |textadj(adj A)| = |A|^(3-1)^2 = |A|^4. Substitute this into the matching requirement equation set: left(|A|^4right)^frac(n-1)^22 = |A|^3n^2 - 5n - 4 |A|^2(n-1)^2 = |A|^3n^2 - 5n - 4 Equating exponents since bases are identical: 2(n - 1)^2 = 3n^2 - 5n - 4 2(n^2 - 2n + 1) = 3n^2 - 5n - 4 2n^2 - 4n + 2 = 3n^2 - 5n - 4 n^2 - n - 6 = 0 ### Step 1: Solve for Exponent Parameter Factoring the quadratic parameter relation: (n - 3)(n + 2) = 0 implies n = 3 quad textor quad n = -2 Both choices are valid integers, so the set S = \-2, 3\. ### Step 2: Calculate the Target Summation We need to evaluate sum_nin S |A^n^2 + n| = |A^(-2)^2 + (-2)| + |A^(3)^2 + 3|: - For n = -2, n^2 + n = 4 - 2 = 2 implies |A^2| = |A|^2 = 3 - For n = 3, n^2 + n = 9 + 3 = 12 implies |A^12| = |A|^12 = (sqrt3)^12 = 3^6 = 729 Summing these evaluated values: textTotal = 3 + 729 = 732 ### Pattern Recognition Always remember that |A^k| = |A|^k. Calculating determinant transformations directly as scalar power factors first prevents rendering high order numerical values prematurely. ### Evaluation Rubric / Model Answer null ### Chapter Mix Class 12 Mathematics: Matrices and Determinants
Q67 jee_main_2025_07_april_morning System of Linear Equations
Let the system of equations : 2 x + 3 y + 5 z = 9, 7 x + 3 y - 2 z = 8, 1 2 x + 3 y - (4 + lambda) z = 1 6 - mu , have infinitely many solutions. Then the radius of the circle centred at (lambda, mu) and touching the line 4 x = 3 y is
  • A. frac175
  • B. frac75
  • C. 7
  • D. frac215

Solution

### Related Formula For a system of three linear equations to possess infinitely many solutions, the main determinant Delta must equal 0, along with all auxiliary determinants: Delta_x = Delta_y = Delta_z = 0. The perpendicular radius distance from a point (x_0, y_0) to a line Ax + By + C = 0 is: d = frac|Ax_0 + By_0 + C|sqrtA^2 + B^2 ### Core Logic Set the coefficient matrix determinant Delta = 0: left| beginmatrix 2 & 3 & 5 \\ 7 & 3 & -2 \\ 12 & 3 & -(lambda + 4) endmatrix right| = 0 Expanding row layout variations or applying column actions yields: 2[-3(lambda + 4) + 6] - 3[-7(lambda + 4) + 24] + 5[21 - 36] = 0 -6lambda - 24 + 12 + 21lambda + 84 - 72 - 75 = 0 15lambda - 75 = 0 implies lambda = 5 ### Step 1: Solve for the Constant Parameter Using Cramer's condition for the infinite solution constraint, evaluate the structural augmented row columns component matrix Delta_y = 0: left| beginmatrix 2 & 9 & 5 \\ 7 & 8 & -2 \\ 12 & 16 - mu & -9 endmatrix right| = 0 Solving this configuration yields: mu = 9 Hence, the circle center is (lambda, mu) = (5, 9). ### Step 2: Calculate Radius via Distance The line is given as 4x - 3y = 0. Calculate the perpendicular distance from (5, 9) to this line: textRadius = frac|4(5) - 3(9)|sqrt4^2 + (-3)^2 = frac|20 - 27|5 = frac|-7|5 = frac75 ### Pattern Recognition Notice that since the y-coefficients are identical (3, 3, 3) across all lines, performing raw row subtractions (R_2 - R_1 and R_3 - R_2) strips away the y-variable instantly during structural matrix processing. ### Evaluation Rubric / Model Answer null ### Chapter Mix Class 12 Mathematics: Matrices and Determinants Class 11 Mathematics: Straight Lines
Q74 jee_main_2025_07_april_morning Singular Matrices
The number of singular matrices of order 2, whose elements are from the set \2,3,6,9\ is
Numerical Answer. Answer: 36 to 36

Solution

### Related Formula A 2 times 2 matrix left[ beginmatrix a & d \\ b & c endmatrix right] is singular if its determinant equals 0: ad - bc = 0 implies ad = bc ### Core Logic Elements must be chosen from the set S = \2, 3, 6, 9\. We need to count all valid quadruplets (a, b, c, d) such that the product of the main diagonal equals the product of the off-diagonal. Let's analyze systematic product matching cases: - **Case 1**: Exactly 1 distinct number is used across all four slots. Example: 2 times 2 = 2 times 2. Since there are 4 distinct choices in S, this provides: textWays = ^4C_1 = 4 ### Step 1: Evaluate Multi Number Configurations - **Case 2**: Exactly 2 distinct numbers are used. The numbers must pair up to provide identical products (e.g., a=d and b=c). Choosing 2 numbers from 4: ^4C_2 = 6 pairs. Each pair can be arranged in 4 unique layouts (2 times 2 arrangements). textWays = 6 times 4 = 24 ### Step 2: Evaluate Four Distinct Element Sets - **Case 3**: Exactly 3 distinct numbers are used. None will satisfy the strict ad = bc zero determinant equality constraints without repeating products. textWays = 0 - **Case 4**: Exactly 4 distinct numbers are used. We need ad = bc using the entire set \2, 3, 6, 9\. Notice that 2 times 9 = 18 and 3 times 6 = 18. This forms a matching product combination pair. The number of unique matrices that can be built by assigning these elements to the diagonal slots is: textWays = 2 times 4 = 8 ### Step 3: Total Summation Sum the total count of valid singular configurations: textTotal Matrices = 4 + 24 + 0 + 8 = 36 ### Pattern Recognition Always break down element counting problems involving determinants into distinct number-repetition subsets (1 number repeated, 2 numbers repeated, etc.) to ensure no configuration is missed. ### Evaluation Rubric / Model Answer null ### Chapter Mix Class 12 Mathematics: Matrices and Determinants Class 11 Mathematics: Permutations and Combinations

More Determinants Questions — jee_main_2024_30_jan_morning

Practice all Determinants previous-year questions →

Rankbit System
JEE Physics: Waves (+15.5%) | Electrostatics: Concentric Shells (-29.7%) | Modern Physics: Photoelectric Clones (+34.2%) | Mathematics: Definite Integrals (+18.1%) | Chemistry: Coordination Splitting (-11.4%) | JEE Physics: Waves (+15.5%) | Electrostatics: Concentric Shells (-29.7%) | Modern Physics: Photoelectric Clones (+34.2%) | Mathematics: Definite Integrals (+18.1%) | Chemistry: Coordination Splitting (-11.4%)