Q.If a1,a2,a3,…,ar are in G.P., then prove that the determinant ar+1ar+7ar+11ar+5ar+11ar+17ar+9ar+15ar+21 is independent of r.
🔒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: …
Key idea: write each G.P. term as akn−1 and factor the powers of k out of each row; the first two rows become identical, so the determinant is 0 for every r.
Step 1 — with an=akn−1, factor akr from R1, akr+6 from R2, akr+10 from R3:
Δ=a3k3r+16111k4k4k6k8k8k10. …
Writing an=akn−1 and factoring the row powers leaves rows 1 and 2 both equal to (1,k4,k8); two equal rows make the determinant 0, which carries no r, so it is independent of r.
Intuition
In a G.P. every term is akn−1. Inside the determinant that means each row is a power of k times a fixed pattern. Once you pull those powers out, you can read off whether any two rows coincide — and here two of them do, which is what makes the value 0 regardless of r.
Setting up
Let the first term be a and the common ratio k, so an=akn−1:
Δ=ar+1ar+7ar+11ar+5ar+11ar+17ar+9ar+15ar+21.
Working the steps
1. Replace each entry. Using ar+t=akr+t−1:
Δ=akrakr+6akr+10akr+4akr+10akr+16akr+8akr+14akr+20.
2. Factor a common power from each row. Row 1 has akr, row 2 has akr+6, row 3 has akr+10:
Δ=a3k3r+16111k4k4k6k8k8k10. …
Method: Factoring Out G.P. Powers to Expose Equal (or Proportional) Rows
Use this method whenever a determinant's entries are consecutive terms of a G.P. (or any geometric-type sequence) and you're asked to prove the value doesn't depend on some index like r.
Steps
Step 1: Write every entry using the G.P.'s general term
If the sequence has first term a and common ratio k, its n-th term is an=akn−1. Rewrite every entry of the determinant this way so all entries become powers of the same a and k, with only the exponent changing from entry to entry.
Step 2: Factor the lowest common power out of each row
Each row shares a common factor ak(row’s smallest exponent) — pull it out using the scaling property of determinants (det→kdet when a row is scaled by k; pulling a factor OUT of a row is the same operation run in reverse, tracked explicitly as a multiplier in front of the determinant). What remains inside each row is a simple ratio-power pattern like 1, kp, kq.
Step 3: Compare the reduced rows …
Common Mistakes
Mistake 1: Misindexing the G.P. exponents when substituting an=akn−1
Why it's wrong: writing ar+1 as akr but then treating ar+7 as akr+7 (forgetting the "−1" in the exponent) throws off every subsequent row and can hide or create a coincidence that isn't really there. Correct approach: substitute one general term first (ar+t=akr+t−1), then plug in t=1,5,9 etc. for each row systematically, rather than guessing exponents by pattern.
Mistake 2: Jumping to direct cofactor expansion instead of factoring out powers of k …
Showing the 12 most recent of 32 on this concept.
- 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). …
- 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 2022Set eng-2022-07-04-AN1 markMCQQ.If a, b, c are respectively the 5th, 8th, 13th terms of an arithmetic progression, then abc5813111= (A) 0 (B) 1 (C) abc (D) 520
›Reveal solutionSolution
Since a,b,c are AP terms whose positions (5, 8, 13) are also linear in the same way, the determinant with columns (term, position, 1) is identically zero.
Concept and Intuition
If a,b,c are terms of an AP at positions p,q,r respectively, then a=A+(p−1)d, b=A+(q−1)d, c=A+(r−1)d — i.e. each term is an affine (linear) function of its position. A determinant of the form termposition1 over three such rows is always zero, because the "term" column is a linear combination of the "position" column and the "1" column (row reduction makes a column of zeros).
Step-by-Step Solution
- Let the AP have first term A and common difference d. Then a=A+4d (5th term), b=A+7d (8th term), c=A+12d (13th term).
- Expand the determinant along the first row: Δ=a(8⋅1−1⋅13)−5(b⋅1−1⋅c)+1(b⋅13−8⋅c) =a(−5)−5(b−c)+(13b−8c)=−5a−5b+5c+13b−8c=−5a+8b−3c.
- Substitute: −5a=−5A−20d, 8b=8A+56d, −3c=−3A−36d. …
- AP EAPCET 2021Set eng-2021-08-25-FN1 markMCQQ.If a,b,c are real numbers such that a2+b2+c2−ab−bc−ac≤0, then (a−b+1)5a11−b11a15−b15b7−c7(b−c+2)3b17−c17c9−a9c13−a13(c−a+3)1= (A) 2abc (B) 0 (C) 24abc (D) 24
›Reveal solutionSolution
The inequality forces a=b=c; substituting collapses the matrix to a simple upper-triangular-looking form whose determinant is just the product of its surviving diagonal terms, 24.
Concept and Intuition
The expression a2+b2+c2−ab−bc−ca is a sum of squares in disguise: 21[(a−b)2+(b−c)2+(c−a)2], which can never be negative. So the given condition "≤0" combined with this built-in "≥0" forces it to be exactly zero, which only happens when a=b=c. That single deduction massively simplifies every entry of the determinant, since almost every entry is a difference of equal powers of a,b,c (which all vanish when a=b=c), leaving only three surviving diagonal-type terms.
Step-by-Step Solution
- Rewrite the condition: a2+b2+c2−ab−bc−ca=21[(a−b)2+(b−c)2+(c−a)2], which is always ≥0.
- Given this quantity is also ≤0, it must equal exactly 0, forcing (a−b)2=(b−c)2=(c−a)2=0, i.e. a=b=c.
- Substitute a=b=c into the matrix: all terms of the form b7−c7, c9−a9, a11−b11, c13−a13, a15−b15, b17−c17 become 0 (difference of equal quantities). …
- 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-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 2025Set eng-2025-05-23-AN1 markMCQQ.If α is a real root of the equation x3+6x2+5x−42=0, then the determinant of the matrix α−1α−2α+4α+1α+3α−4α+2α−3α+5 is (A) 90 (B) 120 (C) -105 (D) -135
›Reveal solutionSolution
The cubic has a unique real root α=2 (found by testing small integers and confirming the remaining quadratic has no real roots); substituting into the determinant and expanding gives −105.
Concept and Intuition
When a cubic is asked to have "a real root," it's often meant to be found by the rational root theorem (testing small divisors of the constant term) — here the constant is −42, and 2 divides it. Once found, factor it out and check the resulting quadratic's discriminant to confirm no other real roots exist, so α is unambiguous.
Step-by-Step Solution
- Test x=2 in x3+6x2+5x−42: 8+24+10−42=0. So x=2 is a root.
- Factor: x3+6x2+5x−42=(x−2)(x2+8x+21).
- Discriminant of x2+8x+21 is 64−84=−20<0, so this factor has no real roots — confirming α=2 is the unique real root.
- Substitute α=2 into the matrix:
10635−24−17
- Expand along row 1: …
- 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 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 2021Set eng-2021-08-20-AN1 markMCQQ.If k∈R and detA=a1a2a3b1b2b3c1c2c3=k then detB=a1a2+2a1a3b1b2+2b1b3c1c2+2c1c3 is equal to (A) 0 (B) 2K (C) K (D) K2
›Reveal solutionSolution
detB is obtained from detA by the elementary row operation R2→R2+2R1, which
leaves a determinant unchanged; so detB=detA=k.
Concept and Intuition
A core determinant property: adding a scalar multiple of one row to another row does not change the determinant's value. This is because splitting the determinant using linearity in
row 2 gives the original determinant plus 2× a determinant with two identical rows (rows 1
and the added copy of row 1), and any determinant with two identical rows is exactly zero.
Step-by-Step Solution
- detB=a1a2+2a1a3b1b2+2b1b3c1c2+2c1c3.
- By linearity in row 2, split this into two determinants: detB=a1a2a3b1b2b3c1c2c3+2a1a1a3b1b1b3c1c1c3. …
- AP EAPCET 2021Set eng-2021-08-23-FN1 markMCQQ.If ω is a root of the equation x+x1+1=0, then 1361+ω4+3ω9+6ω1+ω+ω25+4ω+3ω211+9ω+6ω2= (A) 1 (B) −1 (C) 0 (D) 1+ω
›Reveal solutionSolution
Using 1+ω+ω2=0 to simplify the matrix entries and row-reducing gives determinant −1.
Concept and Intuition
ω here is a complex cube root of unity (ω2+ω+1=0, ω3=1). Many determinant entries are partial sums of 1,ω,ω2 multiples, so replacing 1+ω+ω2 by 0 wherever it appears collapses the algebra dramatically.
Step-by-Step Solution
- Entry (1,3)=1+ω+ω2=0.
- Entry (2,3)=5+4ω+3ω2. Since 3ω2=3(−1−ω)=−3−3ω, this equals 5+4ω−3−3ω=2+ω.
- Entry (3,3)=11+9ω+6ω2=11+9ω+6(−1−ω)=5+3ω.
- The matrix is now 1361+ω4+3ω9+6ω02+ω5+3ω.
- Row reduce: R2→R2−3R1=(0,1,2+ω); R3→R3−6R1=(0,3,5+3ω). …
🎓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.