Q.Compute the following:
Concept understanding — Matrix Addition
Matrix Addition: The Intuition
You run a fruit stall and record apples and bananas sold each morning and afternoon in a table:
| Time | Apples | Bananas |
|---|---|---|
| Morning | 10 | 5 |
| Afternoon | 8 | 12 |
That's a matrix — a rectangular array of numbers. Your friend's stall has its own table for the same day (morning: 6 apples, 7 bananas; afternoon: 4 apples, 9 bananas). To get the combined sales, you add the numbers in the same position: morning apples with morning apples, afternoon bananas with afternoon bananas, and so on.
That's matrix addition: you add corresponding entries — numbers in the same row and column.
The Precise Statement
(A+B)ij=Aij+Bij
If A and B have the same size (same number of rows and columns), their sum A+B is a matrix of that size where each entry is the sum of the corresponding entries.
Example:
A=[215−3],B=[0742]
A+B=[2+01+75+4−3+2]=[289−1]
The One Rule You Cannot Break
You can only add matrices with the exact same dimensions. A 2×3 matrix cannot be added to a 3×2 matrix — the positions don't match.
Properties That Feel Natural
Matrix addition behaves like ordinary number addition, inheriting these from the addition of individual entries:
- Commutative: A+B=B+A
- Associative: (A+B)+C=A+(B+C)
- Zero matrix: there's a matrix O (all zeros) with A+O=A
A Quick Check
P=[1−10324],Q=[052−210]
Both are 2×3, so:
P+Q=[1+0−1+50+23+(−2)2+14+0]=[142134]
That's all there is to it — matrix addition is just entry-wise addition, the simplest operation in linear algebra and the foundation for everything that follows.
Matrix Addition, requiring matrices of the same order and defined entry-by-entry, is one of the first operations taught in the CBSE Class 12 Matrices chapter, and "matrix addition rules and properties class 12" is a widely searched revision topic. Its commutative and associative properties, inherited directly from ordinary number addition, are frequently tested as short-answer board exam questions.
Concept: Matrix Addition — add corresponding entries.
(i)
Add entrywise:
Top-left: a+a=2a
Top-right: b+b=2b
Bottom-left: −b+b=0
Bottom-right: a+a=2a
The sum is [2a02b2a].
(ii)
Add entrywise:
Top-left: (a2+b2)+2ab=(a+b)2
Top-right: (b2+c2)+2bc=(b+c)2
Bottom-left: (a2+c2)+(−2ac)=(a−c)2
Bottom-right: (a2+b2)+(−2ab)=(a−b)2
The sum is [(a+b)2(a−c)2(b+c)2(a−b)2].
(iii)
Add entrywise:
Row 1: [−1+12,4+7,−6+6]=[11,11,0]
Row 2: [8+8,5+0,16+5]=[16,5,21]
Row 3: [2+3,8+2,5+4]=[5,10,9]
The sum is 11165115100219.
(iv)
Add entrywise:
Top-left: cos2x+sin2x=1
Top-right: sin2x+cos2x=1
Bottom-left: sin2x+cos2x=1
Bottom-right: cos2x+sin2x=1
The sum is [1111].
Matrix addition is performed element-wise: add the entries in the same row and column position. Each part is a direct application of this rule, yielding a new matrix of the same dimensions.
The Core Idea
Matrix addition is the simplest operation in linear algebra — you just add corresponding entries. If two matrices have the same number of rows and columns, their sum is a new matrix where each element is the sum of the elements in the same position. There is no cross-talk between positions, no multiplication, no special rules. The only requirement is that the matrices be of the same order.
Let’s apply this cleanly to each part.
(i) [a−bba]+[abba]
- Both matrices are 2×2, so addition is defined.
- Add the top-left entries: a+a=2a.
- Add the top-right entries: b+b=2b.
- Add the bottom-left entries: −b+b=0.
- Add the bottom-right entries: a+a=2a.
The result is [2a02b2a].
Notice the bottom-left cancels to zero because the signs are opposite. This is a common pattern when matrices have symmetric and skew-symmetric parts.
(ii) [a2+b2a2+c2b2+c2a2+b2]+[2ab−2ac2bc−2ab]
- Both are 2×2, so proceed element-wise.
- Top-left: (a2+b2)+2ab=a2+2ab+b2=(a+b)2.
- Top-right: (b2+c2)+2bc=b2+2bc+c2=(b+c)2.
- Bottom-left: (a2+c2)+(−2ac)=a2−2ac+c2=(a−c)2.
- Bottom-right: (a2+b2)+(−2ab)=a2−2ab+b2=(a−b)2.
The result is [(a+b)2(a−c)2(b+c)2(a−b)2].
A common mistake is to forget the sign on the second matrix’s bottom-left entry. The term −2ac is subtracted, not added, so the binomial expansion gives (a−c)2, not (a+c)2.
(iii) −182458−6165+1283702654
- Both are 3×3, so add each corresponding entry. It helps to work row by row.
First row:
- Column 1: −1+12=11
- Column 2: 4+7=11
- Column 3: −6+6=0
Second row:
- Column 1: 8+8=16
- Column 2: 5+0=5
- Column 3: 16+5=21
Third row:
- Column 1: 2+3=5
- Column 2: 8+2=10
- Column 3: 5+4=9
The result is 11165115100219.
You can verify your work by checking that the sum of all entries in the original matrices equals the sum of all entries in the result — a quick sanity check.
(iv) [cos2xsin2xsin2xcos2x]+[sin2xcos2xcos2xsin2x]
- Both are 2×2, so add element-wise.
- Top-left: cos2x+sin2x=1 (using the Pythagorean identity).
- Top-right: sin2x+cos2x=1.
- Bottom-left: sin2x+cos2x=1.
- Bottom-right: cos2x+sin2x=1.
Every entry becomes 1, so the result is [1111].
The identity sin2x+cos2x=1 is the key that collapses all four entries to 1.
The sums are: (i) [2a02b2a],
(ii) [(a+b)2(a−c)2(b+c)2(a−b)2],
(iii) 11165115100219,
(iv) [1111].
Method: Entrywise Addition, Including Symbolic and Trigonometric Entries
Use this for sums of matrices whose entries are algebraic expressions or trig functions. The rule is still entrywise, but the arithmetic per entry may simplify using an identity.
Steps
Step 1: Confirm equal orders and add corresponding entries.
(A+B)ij=aij+bij, done position by position for matrices of the same order.
Step 2: Simplify each combined entry algebraically.
Look for perfect-square patterns, e.g. a2+b2+2ab=(a+b)2 and a2+c2−2ac=(a−c)2; respect the sign attached to each cross term.
Step 3: Apply standard identities where entries are trigonometric.
Use identities such as sin2θ+cos2θ=1 to collapse entries. Present each simplified entry in its position to get the final matrix.
Common Mistakes
Mistake 1: Mishandling the sign of a cross term when factoring.
Why it's wrong: a2+c2+(−2ac)=(a−c)2, not (a+c)2; the negative sign flips the binomial. Correct approach: keep the given sign of the 2ac-type term before factoring.
Mistake 2: Forgetting to use the Pythagorean identity to simplify.
Why it's wrong: leaving sin2θ+cos2θ unsimplified misses that each such entry is just 1. Correct approach: apply sin2θ+cos2θ=1 to reduce entries.
Mistake 3: Adding matrices of different orders.
Why it's wrong: addition is undefined unless the orders match. Correct approach: verify both matrices share the same order before adding.
- TG EAPCET 2022Set eng-2022-07-18-FN1 markMCQQ.Let α,β,γ be real numbers. If A=7β−531γα−1119 is a 3×3 matrix satisfying
[!FORMULA] A5−1311=−290−119210
then (adjA)−1+adjA−1= (A) A (B) −A (C) 2A (D) −2A›Reveal solutionSolution
The key idea is that (adjA)−1=detAA and adjA−1=detAA, so their sum is 2⋅detAA. Using the given matrix equation, we find detA=−1, so the sum equals −2A, which is option (D).
We are given a matrix A with unknown entries α,β,γ, and a known vector equation:
A5−1311=−290−119210.
We need to compute (adjA)−1+adjA−1.
Concept and intuition
For any invertible square matrix A, two important identities are:
- adjA=(detA)A−1, so (adjA)−1=detAA.
- adj(A−1)=(detA−1)A=detAA.
Thus, both terms are actually the same: each equals detAA. Their sum is therefore 2⋅detAA.
So the problem reduces to finding detA. We can find it using the given vector equation without fully determining α,β,γ.
Step-by-step reasoning
-
Express the given equation as a system
Let v=(5,−13,11)T and b=(−290,−119,210)T. We have Av=b.
This gives three linear equations in α,β,γ:
-
Row 1: 7⋅5+3⋅(−13)+α⋅11=−290
35−39+11α=−290⟹−4+11α=−290⟹11α=−286⟹α=−26.
-
Row 2: β⋅5+1⋅(−13)+(−11)⋅11=−119
5β−13−121=−119⟹5β−134=−119⟹5β=15⟹β=3.
-
Row 3: (−5)⋅5+γ⋅(−13)+19⋅11=210
−25−13γ+209=210⟹184−13γ=210⟹−13γ=26⟹γ=−2.
So A=73−531−2−26−1119.
-
-
Compute detA
Expand along the first row:
detA=7⋅det(1−2−1119)−3⋅det(3−5−1119)+(−26)⋅det(3−51−2).
Compute each minor:
- First: 1⋅19−(−11)(−2)=19−22=−3.
- Second: 3⋅19−(−11)(−5)=57−55=2.
- Third: 3⋅(−2)−1⋅(−5)=−6+5=−1.
So:
detA=7(−3)−3(2)+(−26)(−1)=−21−6+26=−1.
- Use the adjugate identities Since detA=−1, we have:
(adjA)−1=detAA=−1A=−A,
adj(A−1)=detAA=−A.
Therefore:
(adjA)−1+adjA−1=−A+(−A)=−2A.
Watch outA common mistake is to forget that (adjA)−1=detAA only holds when A is invertible. Here detA=−1=0, so it's fine.
TipNotice we never needed to compute A−1 directly — the identities reduce everything to knowing just detA.
✓Final answerThe correct option is (D).
ANSWER: D
- TG EAPCET 2021Set eng-2021-08-04-AN1 markMCQQ.If 2122kk−1111k+1=Ak2+Bk+C, then A+B+C= (A) 0 (B) 1 (C) −1 (D) 2
›Reveal solutionSolution
Expanding the determinant gives the constant −1, so A=0,B=0,C=−1 and A+B+C=−1.
Expand along the first row
2122kk−1111k+1=2[(k−1)(k+1)−1]−2k[(k+1)−2]+1[1−2(k−1)]
Evaluate each bracket:
- 2[(k2−1)−1]=2(k2−2)=2k2−4
- −2k[k−1]=−2k2+2k
- 1[1−2k+2]=3−2k
Add them
(2k2−4)+(−2k2+2k)+(3−2k)=−1
So the determinant equals −1 for every k, i.e. Ak2+Bk+C=−1, giving A=0, B=0, C=−1.
A+B+C=0+0+(−1)=−1
✓Final answerA+B+C=−1 — option (C).
- TG EAPCET 2026Set eng-2026-05-09-FN1 markMCQQ.Let A be a 3×3 matrix. If A011=2103; A111=01−11; A110=1100 then the rank of (A−I) is (A) 3 (B) 2 (C) 1 (D) 0
›Reveal solutionSolution
Apply (A−I) to the three given (independent) vectors; the three images are linearly independent (determinant 3), so rank(A−I)=3.
Concept. If {v1,v2,v3} is a basis of R3, then rank(M)=dimspan{Mv1,Mv2,Mv3} for any 3×3 matrix M — we never need A itself.
Step 1 — the given vectors form a basis. v1=(0,1,1)T, v2=(1,1,1)T, v3=(1,1,0)T:
det011111110=1=0.
Step 2 — images under A−I. Using the given actions of A:
- (A−I)v1=(2,0,6)T−(0,1,1)T=(2,−1,5)T
- (A−I)v2=(0,0,0)T−(1,1,1)T=(−1,−1,−1)T
- (A−I)v3=(1,0,0)T−(1,1,0)T=(0,−1,0)T
Step 3 — test independence of the images.
det2−15−1−1−10−10
Expanding along the third column (only the middle entry −1 survives): det=−(−1)⋅[−det(25−1−1)]⋅(−1)=(2⋅(−1)−(−1)⋅5)=3=0.
The three images are linearly independent.
Step 4 — conclude. Since (A−I) maps a basis to three independent vectors, rank(A−I)=3. (Consistency check: Av2=0 means 0 is an eigenvalue of A, i.e. 1 is not forced to be an eigenvalue of A — nothing requires A−I to be singular, and indeed it isn't.)
✓Final answerThe correct option is (A): rank(A−I)=3.
ANSWER: A
- TG EAPCET 2025Set eng-2025-05-03-FN1 markMCQQ.If A=121213311 and B=232324422, then ∣Adj(AB)∣= (A) 176 (B) 198 (C) 208 (D) 234
›Reveal solutionSolution
The key idea is to use the property Adj(M)=∣M∣M−1 for invertible matrices, so ∣Adj(AB)∣=∣AB∣3−1=∣AB∣2. Then compute ∣A∣ and ∣B∣ separately, multiply to get ∣AB∣, square it, and take the square root — yielding ∣AB∣ itself. The final result is 198.
We are asked for ∣Adj(AB)∣. The notation ∣⋅∣ means determinant. So we need the determinant of the adjugate of AB, then its square root.
Concept and intuition
For any square matrix M of order n, the adjugate satisfies
M⋅Adj(M)=Adj(M)⋅M=∣M∣In.
If M is invertible, then Adj(M)=∣M∣M−1. Taking determinants of both sides gives a powerful formula:
∣Adj(M)∣=∣M∣n−1.
Here n=3, so ∣Adj(AB)∣=∣AB∣2. Then ∣Adj(AB)∣=∣AB∣ (since determinants are positive here). So the problem reduces to finding ∣AB∣=∣A∣⋅∣B∣.
TipInstead of multiplying A and B (which is messy), just compute the two determinants separately and multiply. That’s the shortcut.
Step-by-step solution
1. Compute ∣A∣.
A=121213311
Use expansion or row operations. Let’s do cofactor expansion along the first row:
∣A∣=1⋅1311−2⋅2111+3⋅2113
=1⋅(1⋅1−1⋅3)−2⋅(2⋅1−1⋅1)+3⋅(2⋅3−1⋅1)
=1⋅(1−3)−2⋅(2−1)+3⋅(6−1)
=1⋅(−2)−2⋅(1)+3⋅(5)=−2−2+15=11.
So ∣A∣=11.
2. Compute ∣B∣.
B=232324422
Expand along the first row:
∣B∣=2⋅2422−3⋅3222+4⋅3224
=2⋅(2⋅2−2⋅4)−3⋅(3⋅2−2⋅2)+4⋅(3⋅4−2⋅2)
=2⋅(4−8)−3⋅(6−4)+4⋅(12−4)
=2⋅(−4)−3⋅(2)+4⋅(8)=−8−6+32=18.
So ∣B∣=18.
3. Find ∣AB∣.
Since ∣AB∣=∣A∣⋅∣B∣, we have
∣AB∣=11×18=198.
4. Apply the adjugate determinant formula.
For a 3×3 matrix M, ∣Adj(M)∣=∣M∣2.
Thus
∣Adj(AB)∣=(198)2.
Then
∣Adj(AB)∣=(198)2=198.
Watch outA common mistake is to forget the square root and pick 1982=39204, which isn’t even among the options. Always check what the question actually asks for.
✓Final answerThe correct option is (B).
ANSWER: B
- TG EAPCET 2025Set eng-2025-05-03-AN1 markMCQQ.If A=121213311 and B=232324422, then ∣Adj(AB)∣= (A) 176 (B) 208 (C) 198 (D) 234
›Reveal solutionSolution
The key idea is to use the property ∣Adj(M)∣=∣M∣n−1 for an n×n matrix, then compute ∣AB∣=∣A∣∣B∣, take the square root, and match the result to the given options. The final value is 198, so the correct option is (C).
We are asked for ∣Adj(AB)∣. The matrices A and B are 3×3, so n=3. A classic result: for any square matrix M of order n, the determinant of its adjugate is ∣M∣n−1. This saves us from actually computing the adjugate — we just need the determinant of AB, then raise it to the appropriate power and take the square root.
Why this works: The adjugate is the transpose of the cofactor matrix, and it satisfies M⋅Adj(M)=∣M∣I. Taking determinants of both sides gives ∣M∣⋅∣Adj(M)∣=∣M∣n, so if ∣M∣=0, we get ∣Adj(M)∣=∣M∣n−1. Here M=AB, so ∣Adj(AB)∣=∣AB∣3−1=∣AB∣2. Then ∣Adj(AB)∣=∣AB∣2=∣AB∣ (since determinants are real numbers, and we take the principal square root). So the problem reduces to finding ∣AB∣=∣A∣⋅∣B∣.
Now we compute step by step.
-
Compute ∣A∣.
A=121213311.
Expand along the first row:
∣A∣=1⋅1311−2⋅2111+3⋅2113
=1⋅(1⋅1−1⋅3)−2⋅(2⋅1−1⋅1)+3⋅(2⋅3−1⋅1)
=1⋅(1−3)−2⋅(2−1)+3⋅(6−1)
=1⋅(−2)−2⋅(1)+3⋅(5)=−2−2+15=11.
-
Compute ∣B∣.
B=232324422.
Expand along the first row:
∣B∣=2⋅2422−3⋅3222+4⋅3224
=2⋅(2⋅2−2⋅4)−3⋅(3⋅2−2⋅2)+4⋅(3⋅4−2⋅2)
=2⋅(4−8)−3⋅(6−4)+4⋅(12−4)
=2⋅(−4)−3⋅(2)+4⋅(8)=−8−6+32=18.
-
Find ∣AB∣.
Since ∣AB∣=∣A∣⋅∣B∣, we have ∣AB∣=11×18=198.
-
Apply the adjugate property.
For n=3, ∣Adj(AB)∣=∣AB∣2=1982.
Then ∣Adj(AB)∣=1982=198.
Watch outA common mistake is to forget the square root and pick 1982=39204, which isn't even among the options. Another is to compute the adjugate directly — that's a lot of work and error-prone. The property ∣Adj(M)∣=∣M∣n−1 is the clean shortcut.
TipNotice that the square root cancels the square from the exponent, so the answer is simply ∣A∣∣B∣. Always check if the problem is designed to test this property rather than brute force.
✓Final answerThe correct option is (C).
ANSWER: C
-
- TG EAPCET 2022Set eng-2022-07-20-FN1 markMCQQ.Let A=201111102. If A−1=αA2+βA+γI, where α,β,γ are real numbers and I is a 3×3 identity matrix, then 17α+5β+γ= (A) −1 (B) −31 (C) 32 (D) 3
›Reveal solutionSolution
The key idea is to use the Cayley–Hamilton theorem to express A−1 as a linear combination of A2, A, and I, then match coefficients to find α,β,γ and compute 17α+5β+γ=32.
The Cayley–Hamilton theorem says every square matrix satisfies its own characteristic equation. That means if we find the characteristic polynomial of A, we can write A3 in terms of lower powers, and then manipulate to get A−1 expressed as a combination of A2, A, and I. This is a standard technique for problems where the inverse is given as a polynomial in the matrix.
Let’s work through it.
- Find the characteristic polynomial of A. For a 3×3 matrix, the characteristic polynomial is
p(λ)=det(λI−A)=λ3−(tr A)λ2+(sum of principal minors)λ−detA.
Here tr A=2+1+2=5.
The sum of principal minors of order 2:
- Minor from rows 1,2 and cols 1,2: det(2011)=2
- Minor from rows 1,3 and cols 1,3: det(2112)=4−1=3
- Minor from rows 2,3 and cols 2,3: det(1102)=2 Sum = 2+3+2=7.
Now detA: expanding along the second row (which has a zero),
detA=0⋅(⋯)+1⋅det(2112)+0⋅(⋯)=(4−1)=3.
So the characteristic polynomial is
p(λ)=λ3−5λ2+7λ−3.
- Apply Cayley–Hamilton. Since A satisfies its own characteristic equation,
A3−5A2+7A−3I=0.
Rearranging,
A3=5A2−7A+3I.
- Express A−1 in terms of A2 and A. Multiply the equation A3−5A2+7A−3I=0 by A−1 (which exists since detA=3=0):
A2−5A+7I−3A−1=0.
Hence
3A−1=A2−5A+7I⇒A−1=31A2−35A+37I.
- Match coefficients. The problem states A−1=αA2+βA+γI. Comparing,
α=31,β=−35,γ=37.
- Compute 17α+5β+γ.
17(31)+5(−35)+37=317−325+37=3−1.
Watch outA common mistake is to forget the factor of 3 when multiplying by A−1 — the constant term −3I becomes −3A−1, not just −3I. Always check that step carefully.
✓Final answerThe value is −31, which corresponds to option (B).
- TG EAPCET 2021Set eng-2021-08-06-AN1 markMCQQ.Let A=10−2−4357−5−9,B=a−b−c. If A and [A:B] have same rank, then (A) 2a+b+c=0 (B) a=2b+c (C) b=2a+c (D) c=2a+b
›Reveal solutionSolution
For a system AX=B to be consistent, the rank of the coefficient matrix A must equal the rank of the augmented matrix [A:B]. By reducing the augmented matrix to row echelon form, we find the condition for consistency is 2a−b−c=0, which simplifies to a=2b+c.
The core idea behind this problem is the consistency condition for a system of linear equations. When we have a system of linear equations represented as AX=B, where A is the coefficient matrix, X is the column vector of variables, and B is the column vector of constants, the system has a solution if and only if the rank of the coefficient matrix A is equal to the rank of the augmented matrix [A:B].
The augmented matrix [A:B] is formed by appending the column vector B to the matrix A. When we perform elementary row operations on [A:B] to reduce A to its row echelon form, any row that becomes entirely zero in the A part must also have a zero in the corresponding position in the B part. If a row in the A part becomes all zeros, but the corresponding entry in the B part is non-zero, it implies an equation of the form 0=k (where k=0), which is a contradiction. In such a case, the system would be inconsistent, and the rank of [A:B] would be greater than the rank of A.
Therefore, to find the condition for rank(A)=rank([A:B]), we will reduce the augmented matrix [A:B] to its row echelon form and ensure that any row of zeros in the A portion also results in a zero in the B portion.
- Form the augmented matrix [A:B]. Given A=10−2−4357−5−9 and B=a−b−c, the augmented matrix is:
[A:B]=10−2−4357−5−9:::a−b−c
- Perform elementary row operations to reduce the matrix A to row echelon form. Our goal is to create zeros below the leading entries. First, we make the entry in the third row, first column zero using R1:
R3→R3+2R1
The new third row will be: $( -2 + 2(1) \quad 5 + 2(-4) \quad -9 + 2(7) \quad : \quad -c + 2(a) )$ $( 0 \quad 5 - 8 \quad -9 + 14 \quad : \quad 2a - c )$ $( 0 \quad -3 \quad 5 \quad : \quad 2a - c )$ The augmented matrix becomes:100−43−37−55:::a−b2a−c
- Continue row operations to further reduce A. Next, we make the entry in the third row, second column zero using R2:
R3→R3+R2
The new third row will be: $( 0 + 0 \quad -3 + 3 \quad 5 + (-5) \quad : \quad (2a - c) + (-b) )$ $( 0 \quad 0 \quad 0 \quad : \quad 2a - b - c )$ The augmented matrix in row echelon form is:100−4307−50:::a−b2a−b−c
- Apply the rank condition. From the row echelon form, we can see that the rank of matrix A (the 3×3 block on the left) is 2, because there are two non-zero rows. For the rank of the augmented matrix [A:B] to also be 2, the third row of the augmented matrix must be entirely zero. This means the entry in the B part of the third row must be zero. Therefore, we must have:
2a−b−c=0
-
Simplify the condition and match with options.
The condition 2a−b−c=0 can be rewritten as 2a=b+c.
Dividing by 2, we get a=2b+c.
Comparing this with the given options:
(A) 2a+b+c=0
(B) a=2b+c
(C) b=2a+c
(D) c=2a+b
Our derived condition matches option (B).
✓Final answerThe condition for A and [A:B] to have the same rank is a=2b+c.
- TG EAPCET 2025Set eng-2025-05-02-FN1 markMCQQ.If Δr=3r−2103r−523r+13, then ∑r=133Δr= (A) 0.99 (B) 0.33 (C) 0.66 (D) 0.55
›Reveal solutionSolution
The determinant Δr is calculated as the product of its diagonal elements, which simplifies to a form suitable for partial fraction decomposition. This decomposition reveals a telescoping sum, leading to a final value of 0.99.
The problem asks us to evaluate a sum of determinants. The first step is to understand how to calculate the determinant of the given 2×2 matrix Δr. Once we have a simplified expression for Δr, we will look for a pattern that allows us to efficiently sum the terms from r=1 to r=33. Often, such sums involve telescoping series, which can be achieved by expressing each term as a difference of two consecutive terms.
- Calculate the determinant Δr. For a 2×2 matrix (acbd), the determinant is given by ad−bc. In our case, Δr=3r−2103r−523r+13. Applying the formula:
Δr=(3r−21)(3r+13)−(3r−52)(0)
Δr=(3r−2)(3r+1)3
Notice that this is a lower triangular matrix (all elements above the main diagonal are zero). For such matrices, the determinant is simply the product of the diagonal elements.2. Decompose Δr using partial fractions.
To make the sum ∑Δr easier to evaluate, we aim to express Δr as a difference of two terms. This is a common technique for telescoping sums. We use partial fraction decomposition for the expression (3r−2)(3r+1)3.
Let
(3r−2)(3r+1)3=3r−2A+3r+1B
Multiplying both sides by $(3r-2)(3r+1)$, we get:3=A(3r+1)+B(3r−2)
To find $A$, set $3r-2=0$, which means $r = \frac{2}{3}$:3=A(3(32)+1)+B(0)
3=A(2+1)⟹3=3A⟹A=1
To find $B$, set $3r+1=0$, which means $r = -\frac{1}{3}$:3=A(0)+B(3(−31)−2)
3=B(−1−2)⟹3=−3B⟹B=−1
So, the partial fraction decomposition is:Δr=3r−21−3r+11
- Evaluate the sum ∑r=133Δr. Now we need to sum this expression from r=1 to r=33:
∑r=133Δr=∑r=133(3r−21−3r+11)
Let's write out the first few terms and the last term to observe the telescoping pattern: For $r=1$: $\frac{1}{3(1)-2} - \frac{1}{3(1)+1} = \frac{1}{1} - \frac{1}{4}$ For $r=2$: $\frac{1}{3(2)-2} - \frac{1}{3(2)+1} = \frac{1}{4} - \frac{1}{7}$ For $r=3$: $\frac{1}{3(3)-2} - \frac{1}{3(3)+1} = \frac{1}{7} - \frac{1}{10}$ ... For $r=33$: $\frac{1}{3(33)-2} - \frac{1}{3(33)+1} = \frac{1}{99-2} - \frac{1}{99+1} = \frac{1}{97} - \frac{1}{100}$ When we sum these terms, the intermediate terms cancel out:(1−41)+(41−71)+(71−101)+⋯+(971−1001)
The sum simplifies to the first part of the first term and the second part of the last term:∑r=133Δr=1−1001
- Calculate the final value.
1−1001=100100−1=10099=0.99
✓Final answerThe value of ∑r=133Δr is 0.99.
- TG EAPCET 2022Set eng-2022-07-20-AN1 markMCQQ.If A is a 2×2 matrix such that detA=−21 and trace of A3 is 2024, then the trace of A is (A) 6 (B) 11 (C) 12 (D) 13
›Reveal solutionSolution
For a 2×2 matrix, the trace of A3 can be expressed in terms of detA and trA using the Cayley–Hamilton theorem. Solving the resulting cubic gives trA=11.
The key idea is that for any 2×2 matrix, its characteristic polynomial is t2−(trA)t+detA=0. By the Cayley–Hamilton theorem, the matrix itself satisfies this polynomial: A2−(trA)A+(detA)I=0. This lets us reduce higher powers of A to linear combinations of A and I, making the trace of A3 computable from just the trace and determinant of A.
- Write the Cayley–Hamilton relation. For a 2×2 matrix A, we have
A2−(trA)A+(detA)I=0.
Rearranging:
A2=(trA)A−(detA)I.
- Find A3 in terms of A and I. Multiply both sides by A:
A3=(trA)A2−(detA)A.
Now substitute the expression for A2 from step 1:
A3=(trA)[(trA)A−(detA)I]−(detA)A.
Simplify:
A3=[(trA)2−detA]A−(trA)(detA)I.
- Take the trace of both sides. Recall that tr(cA)=ctrA and tr(cI)=2c for a 2×2 identity. So:
tr(A3)=[(trA)2−detA]trA−(trA)(detA)⋅2.
Simplify:
tr(A3)=(trA)3−(detA)(trA)−2(detA)(trA).
tr(A3)=(trA)3−3(detA)(trA).
For any 2×2 matrix A,
tr(A3)=(trA)3−3(detA)(trA).
- Plug in the given values. We have detA=−21 and tr(A3)=2024. Let t=trA. Then:
2024=t3−3(−21)t=t3+63t.
So:
t3+63t−2024=0.
-
Solve the cubic.
Test the given options: 6, 11, 12, 13.
- For t=6: 216+378−2024=−1430=0.
- For t=11: 1331+693−2024=0. Bingo.
- For t=12: 1728+756−2024=460=0.
- For t=13: 2197+819−2024=992=0.
Only t=11 satisfies the equation.
Watch outA common mistake is to forget the factor of 2 when taking the trace of (trA)(detA)I. Since I is 2×2, its trace is 2, not 1. This would lead to an incorrect coefficient of 2 instead of 3 in the formula.
✓Final answerThe trace of A is 11, which corresponds to option (B).
🎓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.