Q.Evaluate the following:
Concept understanding — Arithmetic Progression Determinant
What is an Arithmetic Progression Determinant?
You already know what an arithmetic progression (AP) is — a sequence where each term differs from the previous one by a fixed number called the common difference d. For example, 2,5,8,11,… is an AP with d=3.
Now imagine you take three terms from an AP — any three, not necessarily consecutive — and arrange them in a 3×3 determinant like this:
apxbqycrz
If the numbers in each row (or each column) form an arithmetic progression, something remarkable happens: the determinant is always zero. That is the core idea.
The Intuition
Why should that be true? Think about what a determinant measures. Geometrically, a 3×3 determinant gives the volume of a parallelepiped formed by three vectors. If those vectors are "linearly dependent" — meaning one can be written as a combination of the others — the volume collapses to zero.
When numbers in a row (or column) are in AP, that row is of the form:
a, a+d, a+2d
This is a linear function of the column index. The same linear pattern repeats across rows (or columns). That repetition creates a dependency: the second row is a linear combination of the first and third, or something similar. The determinant detects this dependency and returns zero.
The determinant being zero does not mean the AP is "trivial" or the numbers are equal. It means the rows (or columns) are not independent — they are related by the AP structure.
The Precise Statement
If the elements of each row (or each column) of a 3×3 determinant are in arithmetic progression, then the value of the determinant is zero.
Let's write it clearly. Suppose we have a determinant:
Δ=a1b1c1a2b2c2a3b3c3
Case 1 — Rows in AP:
If a1,a2,a3 are in AP, and b1,b2,b3 are in AP, and c1,c2,c3 are in AP, then Δ=0.
Case 2 — Columns in AP:
If a1,b1,c1 are in AP, and a2,b2,c2 are in AP, and a3,b3,c3 are in AP, then Δ=0.
The condition must hold for every row (or every column) simultaneously. If only one row is an AP and the others are not, the determinant is not necessarily zero.
A Quick Proof (for the curious)
Take the row-AP case. Let the first row be a, a+d1, a+2d1, the second row b, b+d2, b+2d2, and the third row c, c+d3, c+2d3. Write the determinant:
Δ=abca+d1b+d2c+d3a+2d1b+2d2c+2d3
Now perform column operations: C2→C2−C1 and C3→C3−C1. This gives:
Δ=abcd1d2d32d12d22d3
Factor 2 from the third column:
Δ=2abcd1d2d3d1d2d3
Now the second and third columns are identical. A determinant with two equal columns is zero. Hence Δ=0.
Column operations are your best friend for proving determinant properties. The same trick works for the column-AP case — just use row operations instead.
Why This Matters for Exams
This property is a shortcut. In a problem, if you spot that each row (or each column) of a 3×3 determinant is an AP, you can immediately write the answer as 0 without expanding. That saves time and avoids algebraic errors.
Example:
Evaluate:
123456789
Look at the rows: 1,4,7 (AP with d=3), 2,5,8 (AP with d=3), 3,6,9 (AP with d=3). So the determinant is 0.
The AP determinant property is a sufficient condition for zero — if the condition holds, the determinant is zero. But the converse is not true: a determinant can be zero for many other reasons. Don't assume that a zero determinant implies an AP structure.
One More Thing
This property generalizes. For an n×n determinant, if each row (or each column) is an arithmetic progression, the determinant is zero for n≥3. For n=2, an AP row just means the two numbers differ by a constant — that doesn't force the determinant to zero (try it: 1234=−2). The magic only kicks in from 3×3 onward.
So now, whenever you see a 3×3 determinant with a clear AP pattern in rows or columns, you know the answer instantly: 0.
Each determinant is evaluated directly — the 2×2 cases via ad−bc, and the 3×3 case via expansion along the first row.
(i) 0 (ii) −53 (iii) 25 (iv) 0 (v) 18.
Evaluating each determinant: 0, −53, 25, 0, 18.
2×2: acbd=ad−bc. 3×3 (expansion along row 1): adgbehcfi=a(ei−fh)−b(di−fg)+c(dh−eg).
- (i) 46−2−3=4(−3)−(−2)(6)=−12+12=0.
- (ii) 741−7=7(−7)−1(4)=−49−4=−53.
- (iii) 3−118=3(8)−1(−1)=24+1=25.
- (iv) −35−2−17−62−86: expand along row 1:
−3[7(6)−(−8)(−6)]−(−1)[5(6)−(−8)(−2)]+2[5(−6)−7(−2)]
=−3(42−48)+1(30−16)+2(−30+14)=−3(−6)+14+2(−16)=18+14−32=0.
- (v) 11220−3130: expand along row 1:
1[0(0)−3(−3)]−2[1(0)−3(2)]+1[1(−3)−0(2)]=1(9)−2(−6)+1(−3)=9+12−3=18.
(i) 0 (ii) −53 (iii) 25 (iv) 0 (v) 18.
🎓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.