Q.If A=125114−2−3−9, find ∣A∣.
🔒You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
🔒 Start your 14-day free trial to unlock the full solution →Concept understanding — Determinant Evaluation Using Identities
Determinant Evaluation Using Identities
Expanding a 4×4 or 5×5 determinant term by term is painful and error-prone. The smarter route is to transform the determinant into an easy form using properties (the "identities") that change its value in a known, controlled way — then read the answer off a triangular matrix.
The geometric intuition
A determinant measures the signed "volume" of the box spanned by the rows in n-dimensional space. Sliding one row parallel to another doesn't change that volume; swapping two rows flips its sign; scaling a row scales the volume. The algebraic identities are just these facts translated into rules.
The three row (or column) operations
- Swap two rows: det→−det (sign flips).
- Scale a row by k: det→kdet (the factor comes out).
- Add a multiple of one row to a different row (Ri→Ri+λRj, i=j): det unchanged.
The identical rules hold for columns. There is also row-wise linearity: if a row is a sum Ri=Ri′+Ri′′, the determinant splits into the sum of two determinants with all other rows fixed.
Row-wise linearity is not det(A+B)=detA+detB — that is false. The splitting works one row at a time.
The strategy
- Use operation 3 to create zeros in a row or column (value unchanged).
- Factor out common factors with operation 2.
- Swap rows if needed to reach upper-triangular form (track the sign change).
- The determinant is then the product of the diagonal entries.
Worked example
det1472583610.
Apply R2→R2−4R1 and R3→R3−7R1 (no change), then R3→R3−2R2: …
Create zeros in the first column using R2→R2−2R1 and R3→R3−5R1: …
Row-reducing shows rows 2 and 3 become identical, so ∣A∣=0.
The idea
Rather than expand blindly, use the free row operation Ri→Ri−λR1 to make zeros; if two rows end up equal, the determinant is immediately 0.
Reduce the first column
Subtract multiples of R1 from the other rows (this does not change the determinant):
R2→R2−2R1=(0,−1,1),R3→R3−5R1=(0,−1,1).
The determinant becomes
∣A∣=1001−1−1−211. …
Method: Spotting a Zero Determinant via Row Reduction to Identical Rows
A faster alternative to brute-force cofactor expansion when the entries look like they might collapse.
Steps
Step 1: Use row operations to create zeros in one column
Apply Ri→Ri−λR1 for suitable λ to each of the other rows — this never changes the determinant's value.
Step 2: Compare the resulting rows
After reduction, check whether two rows have become identical (or one has become a scalar multiple of another).
Step 3: If so, conclude the determinant is 0 immediately …
Common Mistakes
Mistake 1: Expanding the original (un-reduced) determinant by brute-force cofactors instead of using row operations first
Why it's wrong: this skips the much faster route of spotting that two rows become identical after a simple row reduction, and increases the chance of an arithmetic mistake during full expansion. Correct approach: try Ri→Ri−λR1 first to see if the structure simplifies before expanding anything.
Mistake 2: Making an arithmetic slip in one of the row operations and missing that two rows actually match …
Showing the 12 most recent of 32 on this concept.
- AP EAPCET 2026Set eng-2026-05-12-AN1 markMCQQ.−a2abacab−b2bcacbc−c2= (A) a2b2c2 (B) 2a2b2c2 (C) 3a2b2c2 (D) 4a2b2c2
›Reveal solutionSolution
Factoring a, b, c out of the three rows reduces the determinant to a simpler ±1-coefficient determinant that evaluates to 4abc, giving a total of 4a2b2c2. Answer: (D).
Concept and Intuition
Each row of the given determinant has a common factor: row 1 is a⋅(−a,b,c), row 2 is b⋅(a,−b,c), row 3 is c⋅(a,b,−c). Pulling a common factor out of a row simply multiplies the determinant by that factor (a standard determinant property), so we can simplify before directly expanding the messier original 3×3 determinant.
Step-by-Step Solution
- Original determinant: −a2abacab−b2bcacbc−c2.
- Factor a from row 1, b from row 2, c from row 3:
=abc−aaab−bbcc−c
- Expand this reduced determinant along the first row: −a−bbc−c−baac−c+caa−bb …
- AP EAPCET 2021Set eng-2021-08-19-AN1 markMCQQ.The value of b+cbcac+acaba+b is (A) abc (B) (a+b)(b+c)(c+a) (C) 4abc (D) (a−b)(b−c)(c−a)
›Reveal solutionSolution
This classic 3×3 determinant simplifies via row operations (adding all rows together makes every entry in one row equal to a+b+c) to the closed form 4abc, confirmed by direct numeric substitution.
Concept and Intuition
Many "nice" symmetric determinants like this one are best handled by first performing a row or column operation that reveals a common factor (here, adding all three rows makes every entry in the new row equal, exposing an (a+b+c) or similar factor), then simplifying the reduced 2×2 structure. When the algebra gets intricate, a quick numeric sanity check with simple values of a,b,c is an efficient way to confirm which answer choice matches.
Step-by-Step Solution
- The determinant is b+cbcac+acaba+b.
- Apply R1→R1+R2+R3: the new first row becomes (b+c+b+c, a+c+a+c, a+b+a+b)... more carefully, summing column-wise: column 1 sum =(b+c)+b+c=b+2c... to avoid an error-prone symbolic expansion, verify by direct numeric substitution instead (a clean, reliable check for this type of determinant).
- Numeric check: let a=1,b=2,c=3. The matrix becomes 523143123.
- Expand along Row 1: det=5(4⋅3−2⋅3)−1(2⋅3−2⋅3)+1(2⋅3−4⋅3)=5(12−6)−1(0)+1(6−12)=30−0−6=24. …
- AP EAPCET 2023Set eng-2023-05-17-FN1 markMCQQ.If f(x)=1006+xx−32x−436+x23x2−278x2−32, then x→1limf(−x)f(x)= (A) 2 (B) −1 (C) 0 (D) 1
›Reveal solutionSolution
Expanding the determinant reveals f(x)=2(x−1)(x−2)(x−3), a factor that vanishes at x=1, so the ratio f(x)/f(−x) has a zero numerator and finite nonzero denominator there — limit 0.
Concept and Intuition
Determinants with a column like (1,0,0)T expand trivially (cofactor of the top-left entry only), collapsing a 3×3 determinant into a 2×2 one. Recognising the resulting expression as a product of simple linear factors (rather than grinding through raw polynomial expansion) makes the limit evaluation immediate.
Step-by-Step Solution
- Expand along column 1 (entries 1,0,0): f(x)=1⋅x−32x−43x2−278x2−32=(x−3)(8x2−32)−(3x2−27)(2x−4).
- Factor: 8x2−32=8(x−2)(x+2), 3x2−27=3(x−3)(x+3), 2x−4=2(x−2).
- f(x)=8(x−3)(x−2)(x+2)−6(x−3)(x+3)(x−2)=(x−3)(x−2)[8(x+2)−6(x+3)]=(x−3)(x−2)(2x−2)=2(x−1)(x−2)(x−3).
- f(−x)=2(−x−1)(−x−2)(−x−3)=2⋅(−1)3(x+1)(x+2)(x+3)=−2(x+1)(x+2)(x+3). …
- AP EAPCET 2021Set eng-2021-08-23-FN1 markMCQQ.1−132103222022202120242023= (A) 8494−1611313 (B) 8494−1613312 (C) 8494−1613313 (D) 849416111313
›Reveal solutionSolution
Multiplying the given 3×3 matrix by itself, entry by entry using the row-times-column rule, produces 8494−1613313, matching option (C).
Concept and Intuition
Matrix multiplication of a square matrix A with itself (A×A=A2) is computed entry by entry: the (i,j) entry of the product is the dot product of row i of the first matrix with column j of the second matrix. Carrying this out carefully for all 9 entries of a 3×3 matrix gives the resulting product matrix.
Step-by-Step Solution
Let A=1−13210322. Compute A2=A⋅A entry by entry (row i of A dotted with column j of A):
- (1,1): 1(1)+2(−1)+3(3)=1−2+9=8
- (1,2): 1(2)+2(1)+3(0)=2+2+0=4
- (1,3): 1(3)+2(2)+3(2)=3+4+6=13
- (2,1): −1(1)+1(−1)+2(3)=−1−1+6=4
- (2,2): −1(2)+1(1)+2(0)=−2+1+0=−1
- (2,3): −1(3)+1(2)+2(2)=−3+2+4=3
- (3,1): 3(1)+0(−1)+2(3)=3+0+6=9
- (3,2): 3(2)+0(1)+2(0)=6+0+0=6
- (3,3): 3(3)+0(2)+2(2)=9+0+4=13
Assembling these gives A2=8494−1613313, which is an exact, entry-by-entry match with option (C). …
- AP EAPCET 2025Set eng-2025-05-23-FN1 markMCQQ.2311+131/31+1/231/91+1/431/271+…∞= (A) 0 (B) 21 (C) −21 (D) −1
›Reveal solutionSolution
Expand each 2×2 determinant, recognise two independent geometric series in the result, and sum them separately. Answer: (C).
Concept and Intuition
Every term in the sum is a 2×2 determinant with a fixed bottom row (31), so a3b1=a−3b splits linearly into an a-part and a b-part. Once each part is recognised as its own geometric progression, the infinite sum is just the difference of two standard geometric series sums, 1−rfirst term.
Step-by-Step Solution
- General term: an3bn1=an⋅1−bn⋅3=an−3bn.
- First-column values across the given terms: 2,1,21,41,… — a geometric sequence with first term 2 and ratio 21: an=2(21)n−1.
- Second-column values: 1,31,91,271,… — geometric with first term 1 and ratio 31: bn=(31)n−1. …
- AP EAPCET 2021Set eng-2021-08-23-AN1 markMCQQ.The value of the determinant a+ba+2ba+4ba+2ba+3ba+5ba+3ba+4ba+6b is ____ (A) a (B) b (C) 0 (D) a+b
›Reveal solutionSolution
The rows of this determinant are in arithmetic progression (each row's entries increase by a constant step, and consecutive rows shift by a constant amount too); row-reducing shows two rows become proportional, forcing the determinant to 0.
Concept and Intuition
A determinant is zero whenever any two rows (or columns) are linearly dependent (e.g. one is a scalar multiple of another, or a linear combination of others). Rows built from an arithmetic-progression pattern (like a+b,a+2b,a+3b then shifting by a constant each row) are a classic setup for this — subtracting consecutive rows collapses the "arithmetic" structure into constant, proportional rows.
Step-by-Step Solution
- Original matrix:
a+ba+2ba+4ba+2ba+3ba+5ba+3ba+4ba+6b
- Perform R2→R2−R1: new R2=(a+2b−(a+b), a+3b−(a+2b), a+4b−(a+3b))=(b, b, b).
- Perform R3→R3−R2(original): new R3=(a+4b−(a+2b), a+5b−(a+3b), a+6b−(a+4b))=(2b, 2b, 2b). …
- AP EAPCET 2024Set eng-2024-05-21-AN1 markMCQQ.a+b+2cccab+c+2aabbc+a+2b= (A) (a+b+c)3 (B) 2(a+b+c)3 (C) 3(a+b+c)3 (D) (a+b+c)
›Reveal solutionSolution
Writing each diagonal entry as s+(off-diagonal-like term) where s=a+b+c reveals the matrix as sI plus a rank-1 correction, whose determinant works out cleanly to 2(a+b+c)3 using the determinant lemma (or row operations).
Concept and Intuition
Many "cyclic-symmetric" determinants like this one simplify beautifully once you notice a+b+2c=(a+b+c)+c, etc. — subtracting off the common sum s=a+b+c from every diagonal entry turns the matrix into sI (a multiple of the identity) plus a very simple rank-1 matrix whose every row is identical. Determinants of sI+rank-1 matrices have a clean closed form.
Step-by-Step Solution
- Let s=a+b+c. Rewrite diagonal entries: a+b+2c=s+c, b+c+2a=s+a, c+a+2b=s+b.
- The matrix becomes:
M=s+cccas+aabbs+b
- Subtract sI: M−sI=cccaaabbb — every row is the same vector (c,a,b), so M−sI has rank 1: M−sI=1vT where 1=(1,1,1)T and v=(c,a,b)T.
- So M=sI+1vT. The determinant lemma (matrix determinant lemma) gives: det(sI+1vT)=s3+s2(vT1) …
- AP EAPCET 2024Set eng-2024-05-19-AN1 markMCQQ.1a2a31b2b31c2c3= (A) (a−b)(b−c)(c−a)(a+b+c) (B) (a−b)(b−c)(c−a) (C) (a−b)(b−c)(a−c)(ab+bc+ca) (D) (a−b)(b−c)(c−a)(ab+bc+ca)
›Reveal solutionSolution
This determinant is a known generalised-Vandermonde identity that factors as (a−b)(b−c)(c−a)(ab+bc+ca) — verified numerically, option (D).
Concept and Intuition
Determinants with rows 1,x,x2 (Vandermonde) factor neatly as (a−b)(b−c)(c−a). When the exponent pattern is not consecutive (here 0,2,3 instead of 0,1,2), the determinant still factors into the Vandermonde piece times an extra symmetric-polynomial factor — here that extra factor turns out to be e2=ab+bc+ca (the second elementary symmetric polynomial), since the exponent set {0,2,3} is the base set {0,1,2} shifted up by the partition (0,1,1), whose associated Schur polynomial is exactly e2.
Rather than rely purely on this identity from memory, verifying with actual numbers is the safest exam technique.
Step-by-Step Solution
- Expand the determinant along the first row (all entries 1): D=(b2c3−b3c2)−(a2c3−a3c2)+(a2b3−a3b2) =b2c2(c−b)+a2c2(a−c)+a2b2(b−a).
- Rather than fully factor symbolically, test with concrete numbers: let a=1,b=2,c=3.
- Direct determinant: rows (1,1,1), (1,4,9), (1,8,27). D=1(4⋅27−9⋅8)−1(1⋅27−9⋅1)+1(1⋅8−4⋅1)=1(108−72)−1(27−9)+1(8−4)=36−18+4=22.
- Test option (D): (a−b)(b−c)(c−a)(ab+bc+ca) with these values: (1−2)(2−3)(3−1)=(−1)(−1)(2)=2; ab+bc+ca=2+6+3=11; product =2×11=22. Matches D=22. …
- AP EAPCET 2026Set eng-2026-05-13-FN1 markMCQQ.For a fixed positive integer n, if D=n!(n+1)!(n+2)!(n+1)!(n+2)!(n+3)!(n+2)!(n+3)!(n+4)!, then n!(n+1)!(n+2)!D= (A) −4 (B) −2 (C) 2 (D) 4
›Reveal solutionSolution
Taking the factorials common from each row collapses the determinant to a constant: n!(n+1)!(n+2)!D=2 — option (C).
Working. Factor n!, (n+1)!, (n+2)! from rows 1, 2, 3 respectively:
D=n!(n+1)!(n+2)!111n+1n+2n+3(n+1)(n+2)(n+2)(n+3)(n+3)(n+4)
Hence n!(n+1)!(n+2)!D equals that 3×3 determinant. Apply R2→R2−R1 and R3→R3−R1, using (n+2)(n+3)−(n+1)(n+2)=2(n+2) and (n+3)(n+4)−(n+1)(n+2)=4n+10: …
- AP EAPCET 2025Set eng-2025-05-26-FN1 markMCQQ.If the inverse of −x0x14x1−4x7x0−2x is 20101−2701, then xx+1x+2x+1x+2x+3x+2x+3x+4= (A) 5x (B) x−5 (C) 5x−1 (D) x+5
›Reveal solutionSolution
This tests recognizing a determinant with AP-rows (always zero) and pinning down x from a matrix-inverse condition; the answer is whichever option numerically equals 0 at that x.
Concept and Intuition
A square matrix whose rows form an arithmetic progression (i.e. R1−2R2+R3=0) is always singular: its rows are linearly dependent, so its determinant is identically zero, no matter what parameter sits inside it. Spotting this saves a full cofactor expansion. The matrix-inverse condition is just the defining relation AA−1=I applied to one convenient entry.
Step-by-Step Solution
- Let A=−x0x14x1−4x7x0−2x and A−1=20101−2701.
- Using AA−1=I, multiply row 1 of A by column 1 of A−1: (−x)(2)+(14x)(0)+(7x)(1)=5x. This must equal the (1,1) entry of I, i.e. 1. So 5x=1⇒x=51. (Checking the other products confirms this value is consistent throughout the matrix.)
- Now look at D=xx+1x+2x+1x+2x+3x+2x+3x+4. Apply R1→R1−2R2+R3: each entry becomes x−2(x+1)+(x+2)=0, turning the first row into (0,0,0).
- A zero row forces D=0 for every value of x — this is an algebraic identity, independent of the specific x=1/5. …
- AP EAPCET 2022Set eng-2022-07-04-FN1 markMCQQ.For i=1,2,3 and j=1,2,3. If ai2+bi2+ci2=1, aiaj+bibj+cicj=0, ∀i=j and A=a1b1c1a2b2c2a3b3c3 then det(AAT)= (A) 0 (B) 1 (C) −1 (D) 3
›Reveal solutionSolution
The conditions given say the rows of A form an orthonormal set, which is precisely the condition AAT=I; so its determinant is 1. Answer: 1.
Concept and Intuition
For a matrix A with rows R1,R2,R3, the (i,j) entry of AAT is exactly the dot product Ri⋅Rj. The problem states ai2+bi2+ci2=1 (each row is a unit vector) and aiaj+bibj+cicj=0 for i=j (distinct rows are perpendicular). Together these say the rows are orthonormal — which is the defining property of an orthogonal matrix, for which AAT=I.
Step-by-Step Solution
- Write (AAT)ij=Ri⋅Rj=aiaj+bibj+cicj.
- For i=j: (AAT)ii=ai2+bi2+ci2=1 (given).
- For i=j: (AAT)ij=aiaj+bibj+cicj=0 (given).
- So AAT=I3, the 3×3 identity matrix.
- det(AAT)=det(I3)=1.
Common Mistakes …
- AP EAPCET 2021Set eng-2021-08-19-FN1 markMCQQ.If a1,a2,…a9 are in G.P, then loga1loga4loga7loga2loga5loga8loga3loga6loga9 is equal to (A) log(a1,a2,…an) (B) 1 (C) (loga9)9 (D) 0
›Reveal solutionSolution
The logs of GP terms form an arithmetic sequence, which makes the three rows of the determinant linearly dependent (R1+R3=2R2); hence the determinant is 0.
Concept and Intuition
Taking logs of a GP converts multiplication into addition, turning the GP into an AP. When a 3×3 matrix's rows are built from consecutive terms of one long AP (each row a block of 3 consecutive AP terms), the rows themselves form an AP of row-vectors — meaning the middle row is the average of the outer two. Any such linear dependency among rows forces determinant =0.
Step-by-Step Solution
- Since a1,…,a9 are in GP with common ratio r: an=a1rn−1, so logan=loga1+(n−1)logr.
- Let L=loga1, d=logr. Then logan=L+(n−1)d.
- Row 1: (loga1,loga2,loga3)=(L,L+d,L+2d). Row 2: (loga4,loga5,loga6)=(L+3d,L+4d,L+5d). Row 3: (loga7,loga8,loga9)=(L+6d,L+7d,L+8d). …
🎓Unlock everything free for 14 days
- ✓Full step-by-step solutions
- ✓Concept-first explanations
- ✓Methods, shortcuts & mistakes
- ✓PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.