Last Minute revision for Unit-1 & II
Last Minute revision for Unit-1 & II
*Relation: Any subset of the Cartesian product A X B of two sets A and B is said to be a relation from A to B.
Example: For A = {a, b} and B = {1, 2, 3}; A X B = {(a, 1), (a, 2), (a, 3), (b, 1), (b, 2), (b, 3)}
Then Relations can be defined as R1 = {(a, 1), (b, 2)}, R2 = {(a, 2), (a, 3), (b, 1), (b, 3)}, etc.
Note: In relation R1 above; (i). ‘1’ is the image of ‘a’ and ‘a’ is the pre-image of ‘1’.(ii). Domain of R1 = {a, b} and Range of R1 = {1, 2}
*Empty Relation: The relation ø which is a subset of A X B is said to be the empty relation in which no element of set A is related
to any element of set B.
*Universal relation: The relation A X B which is a subset of A X B is known as the Universal relation in which all the elements of set
A are related to every element of set B.
*Number of relations: if number of elements in set A& B are p & q i.e.n(A) = p and n(B) = q then n(A X B) = p X q, Number of
subsets of A X B = 2pq. Therefore, total number of relations from set A to set B = 2pq(Since every subset of A X B is a relation from A to B)
Note: Number of non empty relations are 2 pq– 1 (Subtract one empty relation)
Example: Let n(A)=2 & n(B)=3 then total number of relations from A to B=22X3=26=64 &Number of non empty relations=64 – 1=63.
Note: Total number of relations from set A to A (in set A) = 22X2 = 24= 16
*Types of relations:
a. Identity relation I: Every element of A must be related to itself only. For A = {1, 2, 3}, I = {(1,1),(2,2),(3,3)}
b. Reflexive relation: Every element of set A is related to itself. Elements of A may have another image also.
Examples: R1 = {(1,1), (2,2), (3,3), (1,2)}, R2 = {(1,1), (2,2), (3,3), (2, 1), (2, 3)} are reflexive relations.
R3 = {(a, b) / a divides b, a,b ϵ N} is a Reflexive relation as every natural number divides itself.
Note: Every Identity relation is always a reflexive relation but the converse is not true.
c. Symmetric relation: If ‘a’ is related to ‘b’ then ‘b’ is also related to ‘a’ OR if ‘b’ is the R image of ‘a’ then ‘a’ is also the R image
of ‘b’ OR (a, b)ϵ R => (b, a)ϵ R.
Example: R1 = {(1, 2), (2, 1), (2, 3), (3, 2)} is symmetric as (1, 2)ϵ R1 => (2, 1)ϵ R1 and (2, 3)ϵ R1 => (3, 2)ϵ R1.
R2 = {(a, b) / (a - b) is a multiple of 5, a,b ϵ R} is symmetric as (b – a) is also a multiple of 5.
Note: Every Identity relation is symmetric too. [If (1, 2) is not in relation R, we will not search for (2, 1) in relation R]
d. Transitive relation: If (a, b) ϵ R and (b, c) ϵ R then (a, c) ϵ R. Example: R1 = {(1,2), (2, 3), (1, 3)} is transitive.
R2= {(1, 1),(2, 2),(3, 3),(2, 3),(1, 3)} is also transitive[If (a, b)ϵR but (b, c) is not in R then we will not search for (a, c) in R].
R3 = {(a, b) / a < b, a,b ϵ Z} is Transitive as a < b and b < c implies a < c for all integers.
Note: Every Identity relation is Transitive too as there is no case of transitivity.
e. Equivalence Relation: A relation which is Reflexive, Symmetric and Transitive is known as Equivalence relation.
Example: R = {(a, b) / (a – b) is even, a, b ϵ Z }is an Equivalence relation as it is; Reflexive: (a – a)= 0 is an even integer,
Symmetric: If (a – b) is even integer then (b – a) is also an even integer and Transitive: If (a – b) and (b – c) are even integers
then (a- c) is also an even integer [Here (a – c) = (a - b) + (b - c)]
Note: Every Empty relation is Symmetric and Transitive but not Reflexive [(a, a) is not in the empty relation]
Every Universal relation A X A in the set A and the Identity relation I is an Equivalence relation.
*Equivalence Class of an element: Let R be an equivalence relation in set A then equivalence class of an element ‘a’ is the set of
all the images of element ‘a’ and is written as [a].
In the above example; [0] = {...-4, -2, 0, 2, 4,...} and [1] = {...-3, -1, 1, 3,...}(Their intersection is ø and Union is the set Z).
*For a set A with ‘n’ elements:
Number of ↓ General Formula For n = 2 For n = 3 For n = 4
Reflexive relations 2n(n - 1) 4 64 4096
Symmetric Relations 2n(n+1)/2 8 64 1024
Reflexive & Symmetric Relations 2n(n-1)/2 2 8 64
Equivalence Relations No general formula 2 5 15
Important Problems:
1. How many ordered pairs should be added to the relation R = {(1, 1), (2, 3), (3, 1), (2,2)} to make it
a. Reflexive b. Symmetric c. Transitive
Solution: a. 1 ordered pair (3, 3) b. 2 ordered pairs (3, 2) & (1,3) c. 1 ordered pair (2, 1)
2. Find the domain & range of of the relation R = {(x, y) / 3x – y = 12} defined on the set of natural numbers N.
Solution: Here x = (y + 12)/3, so y should be a multiple of 3; hence values of y = Range of relation R = {3, 6, 9, 12,...}
Putting the values of y, we have; values of x = Domain of relation R = {5, 6, 7, ....}
3. Show that the relation R on the set R of real numbers, defined as R = {(a, b) : a ≤ b 2} is neither reflexive nor symmetric nor
transitive. [CBSE (F) 2019]
Solution: We will use appropriate examples for this purpose:
Reflexive: ½ ≤ (½)2 is not true, so not reflexive
Symmetric: 1 ≤ 22 is true hence (1, 2)ϵ R but 2 ≤ 12 is not true hence (2, 1) ɇR, so not symmetric.
Transitive: By taking three real numbers 2, -2 and 1, we have; (2, -2)ϵ R as 2 ≤ (-2)2, (-2, 1)ϵ R as (-2) ≤ 12 but (2, 1)ɇ R,
so f is not transitive.
4. Prove that the relationRIn N X N such that (a, b) R (c, d) if ad (b + c) = bc(a + d) is an equivalence relation.
Solution: Reflexive: (a,b) R (a, b) => ab(b + a) = ba(a + b) which is true for all (a,b) ϵ N X N, Hence R is reflexive.
Symmetric: (c, d) R (a, b)=>cb(d + a)=da(c +b)=>bc(a + d)=ad(b + c)=> ad(b + c)=bc(a + d) => (a, b)R(c, d),
hence symmetric.
Function: A relation from a set A to another set B is said to be a function if every element of set A has unique image in set B. Set A
is said to be its domain and set B the co-domain.
Example: f:N →N/f(x) = x + 3, f:R →R/f(x) = x2, f: R →R/f(x) = sinx, f: R+ → R/ f(x) = logx
Number of functions: For n(A) = p and n(B) = q, Total number of functions from A to B = q p.
Types of functions:
a. One-One (Injective function): Elements of set B have unique pre-image in set A.
Example: f:Z →Zsuch thatf(x) = x + 3, f(x) = y = x + 3 => x = y – 3, for every y ϵ Z, x will be unique in Z.
To prove a function one – one, we assume f(x) = f(y) and prove x = y. Function which is not one-one is many one function.
b. Onto (Surjective function): All the elements of set B must have some (one or more) pre-image in set A.
Example: f:Z →Zsuch that f(x) = x + 3, f(x) = y = x + 3 => x = y – 3, for every y ϵ Z, there exist some x ϵ A such that f(x) = y.
To prove a function onto, show that Range of the function = Co-domain. A function which is not onto is into function.
c. One-One & onto (Bijective Function): A function which is both one-one and onto is known as Bijective function.
The necessary condition for a function to be bijective is n(A) = n(B)
Note: A function f is said to be invertible if it is a bijective function.
Important questions:
4𝑥+3 2
1. Show that the function 𝑓(𝑥) = , 𝑥 ≠ 3 is a bijective function. [CBSE 2012]
6𝑥−4
4𝑥+3 4𝑦+3
Soln. One-one – Let 𝑓(𝑥) = 𝑓(𝑦) ⇒ = ⇒ (4𝑥 + 3)(6𝑦 − 4) = (4𝑦 + 3)(6𝑥 − 4) ⇒ 𝑥 = 𝑦 ⇒ 𝑓 is one one
6𝑥−4 6𝑦−4
4𝑥+3 4𝑦+3 2
Onto – We will find the range of the function; let 𝑦 = 𝑓(𝑥) = ⇒ 𝑦(6𝑥 − 4) = 4𝑥 + 3 ⇒ 𝑥 = ,𝑦 ≠
6𝑥−4 6𝑦−4 3
Hence the Range of the function f = co-domain of function f => f is onto function. Hence Bijective.
2. Show that the following function f : N → N is an invertible function: VV Important
𝑥 + 1, 𝑖𝑓 𝑥 𝑖𝑠 𝑜𝑑𝑑
𝑓(𝑥) = {
𝑥 − 1, 𝑖𝑓 𝑥 𝑖𝑠 𝑒𝑣𝑒𝑛
Soln. Here 𝑓 = {(1, 2), (2, 1), (3, 4), (4, 3), (5, 6), (6, 5),...}. It is clear that every
element of co-domain N has unique pre-image in domain N. Hence f is
invertible function.Also, The given function can be proved invertible/bijective by
drawing an arrow diagram→
3. Consider f : R+ →[4, ∞) given by f(x) = x2 + 4, where R+ is the set of all non negative real numbers.
Show that the function f is invertible. [CBSE (AI) 2013; (F) 2011]
Soln: One-One - Let x1, x2 ϵ R+ (Domain) and f(x1) = f(x2) => x12 + 4 = x22 + 4 => x12 = x22 => x1 = x2 => f is one one function.
Onto– 𝑦 = 𝑥 2 − 4 , 𝑥 = √𝑦 + 4 , 𝑦 𝜖 [4, ∞), 𝑅𝑎𝑛𝑔𝑒 = 𝑐𝑜 − 𝑑𝑜𝑚𝑎𝑖𝑛, hence the function is onto. Hence invertible also.
𝑥
4. Show that the function 𝑓: 𝑅 → 𝑅 defined by 𝑓(𝑥) = 2 is neither one one nor onto. [CBSE 2018]
𝑥 +1
𝑥 𝑦
Soln. One one – Let 𝑓(𝑥) = 𝑓(𝑦) ⇒ = ⇒ 𝑥𝑦 2 + 𝑥 = 𝑦𝑥 2 + 𝑦 ⟹ 𝑥𝑦(𝑥 − 𝑦) − (𝑥 − 𝑦) = 0 ⟹
𝑥 2 +1 𝑦 2 +1
(𝑥 − 𝑦)(𝑥𝑦 − 1) = 0 ⇒ 𝑥 = 𝑦 𝑜𝑟 𝑥 = 1/𝑦.Hence the function is not one one.
𝑥 1±√1−4𝑦 2
Onto – 𝐻𝑒𝑟𝑒 𝑦 = ⟹ 𝑦𝑥 2 − 𝑥 + 𝑦 = 0 ⟹ 𝑥 = , 𝑦 ≠ 0 ⇒ 𝑅𝑎𝑛𝑔𝑒 ≠ 𝐶𝑜 − 𝑑𝑜𝑚𝑎𝑖𝑛 .Hence f is not onto
𝑥 2 +1 2𝑦
Number of one – one / onto functions: For n(A) = p and n(B) = q, we have the following results:
Condition → p=q p<q p>q For p = 3 For p = 2 and For p = 3 and For p = 4 and For p = q =3
and q = 2 q=3 q=4 q=3
Number of one – one p! (Factorial p) 𝑞! 0 0
functions (𝑞 − 𝑝)! 6 24 0 3! = 6
Number of onto p! (Factorial p) qp – qC1 (q – 1)p
functions 0 + qC2(q – 2)p + 6 0 0 36 3! = 6
...
Number of bijective p! (Factorial p)
functions 0 0 0 0 0 0 3! = 6
43𝜋 3𝜋 3𝜋 𝜋 3𝜋 −𝜋 −𝜋
e. 𝑠𝑖𝑛−1 (𝑐𝑜𝑠 ) = 𝑠𝑖𝑛−1 (𝑐𝑜𝑠 (8𝜋 + )) = 𝑠𝑖𝑛−1 (𝑐𝑜𝑠 ) = 𝑠𝑖𝑛−1 (𝑠𝑖𝑛 ( − )) = 𝑠𝑖𝑛 −1 (𝑠𝑖𝑛 ( )) =
5 5 5 2 5 10 10
√3
3. Find the value of 𝑡𝑎𝑛 [2𝑠𝑖𝑛 (2𝑐𝑜𝑠 −1 )]. −1
[CBSE(AI) 2018]
2
𝜋 𝜋
−1 √3
) = 𝑡𝑎𝑛−1 (√3) = 𝜋⁄3.
−1 −1 √3
Solution: 𝑡𝑎𝑛 [2𝑠𝑖𝑛 (2𝑐𝑜𝑠 )] = 𝑡𝑎𝑛 [2𝑠𝑖𝑛 (2 . )] = 𝑡𝑎𝑛−1 [2 sin ] = 𝑡𝑎𝑛−1 (2 .
2 6 3 2
−1 cos 𝑥
4. Simplify: 𝑡𝑎𝑛 ( ) [CBSE 2020]
1−sin 𝑥
𝑥 𝑥 𝑥 𝑥 𝑥 𝑥
cos 𝑥 𝑐𝑜𝑠2 − 𝑠𝑖𝑛2 (𝑐𝑜𝑠 + 𝑠𝑖𝑛 )(𝑐𝑜𝑠 − 𝑠𝑖𝑛 )
Solution: 𝑡𝑎𝑛 −1 ( ) = 𝑡𝑎𝑛−1 [ 𝑥
2
𝑥
2
𝑥 𝑥 ] = 𝑡𝑎𝑛−1 [ 2 2 2
𝑥 2
2
]=
1−sin 𝑥 𝑐𝑜𝑠2 + 𝑠𝑖𝑛2 − 2𝑠𝑖𝑛 𝑐𝑜𝑠 𝑥
(𝑐𝑜𝑠 − 𝑠𝑖𝑛 )
2 2 2 2 2 2
𝑥 𝑥 𝑥
𝑐𝑜𝑠 + 𝑠𝑖𝑛 1+𝑡𝑎𝑛 𝜋 𝑥 𝜋 𝑥 𝒙 𝒙
𝑡𝑎𝑛−1 [ 2
𝑥 𝑥
2
]=𝑡𝑎𝑛−1 [ 2
𝑥 ] = 𝑡𝑎𝑛−1 [𝑡𝑎𝑛 ( 4 + 2)] = 4 + 2 (Here 1 = 𝒄𝒐𝒔𝟐 + 𝒔𝒊𝒏𝟐 )
𝑐𝑜𝑠 − 𝑠𝑖𝑛 1−𝑡𝑎𝑛 𝟐 𝟐
2 2 2
Matrix is a rectangular array of numbers(real or complex) kept inside brackets [] or () and denoted by capital letters. The numbers
are called elements or members or entry
Order of a matrix: A matrix having “m” number of rows and “n” number of columns is of order mxn
Example A=𝑟𝑜𝑤 → 1 −1 3 ↓ 𝑐𝑜𝑙𝑢𝑚𝑛, is a matrix of order 2X3 having element a21 = 2 and a13 = 3
[ ]
2 5 −7
1.Sum of two matrices: for Matrix A=[aij]mxn and B= [bij]mxn, the sum of two matrices A & B defined as matrix C =[c ij]mxn
where cij = aij + bij for all i,j. (To add two matrices of same order, their corresponding elements are added)
2.Multiplication of matrix by scalar : If A=[aij]mxn is a matrix and k is a scalar then kA is another matrix which is obtained by
−2 6 7 4 3 −2 −6 18 21
multiplying each element of A by the scalar k . e.g.For A= [ ],B=[ ] ,3A= [ ]and
4 3 1 5 3 −1 12 9 3
4 + 4 −12 + 3 −14 − 2 8 −9 −16
-2A+B=[ ]=[ ]
−8 + 5 −6 + 3 −2 − 1 −3 −3 −3
3.Multiplication of matrices: Matrix A can be multiplied to matrix B if number of columns in A is equal to number of rows in B. If
A =[aij]mxn and B=[bjk]nxp are two matrices then AB=[cik]mxp and cik = ∑𝑛𝑗=1 a ij bjk [Remark- if AB is defined then BA need not be defined]
2 7
1 −1 2 (1)(2) + (−1)(−1) + (2)(5) ? 13 −2
For [ ] [−1 1 ] = [ ]= [ ]
0 3 4 ? ? 17 −13
5 −4
3 5
T ’ T
Transpose of a matrix: For Matrix A =[aij]mxn transpose of A is denoted by A or A and A =[aji]nxm for example If A=[ √3 1],
−1
0
5
3 √3 0
then A’ = [ −1] [Hint : interchange rows and columns]
5 1
5
Symmetric and skew symmetric matrix: A square matrix A =[aij]mxn is symmetric if A’=A i.e. aij = aji and a square matrix A =[aij]mxn
is skew symmetric matrix if 𝐴’ = −𝐴 e.g. aji = - aij & aii=0 for all possible values of i and j.
√3 2 3 0 −2 3
Example A= [ 2 −1.5 −1] is symmetric matrix as A’=A and B= [ 2 0 −1] is skew symmetric matrix as B’=-B
3 −1 1 −3 1 0
[Remark :For any square matrix A ,A+ A’ is always symmetric and A-A’ is always skew symmetric matrix ]
Minor of an element : Minor of aij in matrix A is denoted by Mij and is the determinant of order (n-1) obtained by deleting the ith
row and jth column of A.
Cofactor of an element : Co-factor of an element aij is denoted by Cij orAij and it’s value is given by Cij = (-1)i+j MijImportant result :
(1)If A is a square matrix of order n,then then |kA|= k n|A|, (2)If A is non singular matrix of order n then |AdjA|= |A|n-1
1
(3)A square matrix A is said to be singular if |A|= 0, (4) If A is a square matrix, then | A-1|=
|𝐴|
Adjoint of a square matrix is transpose of matrix obtained by replacing each element of it by it’s cofactor𝐴𝑖𝑗 and is denoted by
2 −1
Adj(A). If A=[ ] . 𝑀𝑖𝑛𝑜𝑟𝑠 𝑀11 =3(Hint: value after deleting first row and first column) ,𝑀12 = 4,𝑀21 = −1, 𝑀22 = 2,
4 3
3 −4 3 1
Cofactors 𝐴11 =3,𝐴12 = −4,𝐴21 = 1,𝐴22 =2 Then Adj A= Transpose of [ ]= [ ]
1 2 −4 2
Property of Adjoint: (Adj A).A=A. (Adj A) = |A|I , Note: Inverse of only non-singular matrix exists.
Inverse of a square matrix :a non-singular matrix A of order n is called invertible matrix if there exists a square matrix B of order n
𝟏
such that AB=BA=I and B is called inverse of A and vice-versa. The inverse of A is denoted by A-1&A-1 = 𝑨𝒅𝒋 𝑨
|𝑨|
[Remark:A rectangular matrix does not possess inverse]
Solution of system of equations: For the equations, 3x-2y+ 3z= 8, 2x+ y-z =1, 4x-3y+ 2z=4 System of Equations in matrix form can
be expressed as AX=B and X=A-1B where
3 −2 3 𝑥 8
A=[2 1 −1], X= [𝑦] , B= [1], |A|=3(2-3)+2(4+4)+3(-6-4)=-17≠ 0 Hence A is non-singular and it’s inverse exists.
4 −3 2 𝑧 4
𝐴11 =-1 , 𝐴12 =-8, 𝐴13 =-10, 𝐴21 =-5, 𝐴22 =-6,𝐴23 =1,𝐴31 =-1,𝐴32 =9, 𝐴33 =7
−1 −5 −1 −1 −5 −1 8 𝑥 −17 1
−1 −1 −1
A-1= [ −8 −6 9 ] , X=A-1B = [ −8 −6 9 ] [1], [𝑦]= [−34] = [2], hence x=1, y=2, z=3
17 17 17
−10 1 7 −10 1 7 4 𝑧 −51 3
Important questions:Level -1
1. If a matrix has 5 elements what are the possible order it can have ? [Ans. 1X5 and 5X1]
5
1
𝑎11 𝑎12 2
1 1
2. Construct 3X2 matrix whose elements are given by aij = |i-3j|, Hint:[𝑎21 𝑎22 ] Ans. 2
2
2
𝑎31 𝑎32 3×2 3
[0 2]
1 2 3 2 3 1 −3 −4 1
3. If A= = [ ] , B=[ ], then find A-2B. Ans. [ ]
3 1 3 1 0 2 1 1 −1
2 −3 5
4. Find the co-factor of 𝑎12 in A=[ 3 −2 −5] Solution 𝑀12 =(3)(2)-(-5)(-1) =1, 𝐴12 = (−1)1+2 1 =-1
−1 1 2
5.If A is a square matrix of order 3 such that A. (Adj A) = 10I find 𝐴𝑑𝑗𝐴|. (𝐻𝑖𝑛𝑡 𝐴. (𝐴𝑑𝑗 𝐴) = |𝐴|𝐼, 𝐻𝑒𝑛𝑐𝑒 |𝐴| = 10 & |𝐴𝑑𝑗𝐴| = 100)
1 2 3 −7 −8 −9
6.Find the matrix X so that X[ ]=[ ][Solution: Order of matrix X will be 2x2, [𝑎 𝑏 ] [1 2 3] = [−7 −8 −9]
4 5 6 2 4 6 𝑐 𝑑 4 5 6 2 4 6
1 −2
𝑎 +4 𝑏 =-7, 2 𝑎 +5 𝑏 =-8, 𝑐 +4 𝑑 =2,2c+5 𝑑 =4 on solving 𝑎 = 1, 𝑏 = −2, 𝑐 = 2, 𝑑 = 0 Hence X=[ ]
2 0
2 𝑎 5
7.If the matrix A=[−1 4 𝑏] is a symmetric matrix then find 𝑎 + 𝑏 + 𝑐 [𝐴𝑛𝑠. 𝑎 =-1, 𝑏=-4, 𝑐 = 5 hence 𝑎 + 𝑏 + 𝑐 = 0 ]
𝑐 −4 9
Level –III
3 −2 −4
1. Express matrix A as the sum of a symmetric and skew symmetric matrix, where A=[ 3 −2 −5]
−1 1 2
1 5
3 −
3 −2 −4 3 3 −1 6 1 −5 2 2
1 1 1 1
Solution-P= (𝐴 + 𝐴′ ) = [[ 3 −2 −5] + [−2 −2 1 ]]= [ 1 −4 −4] = 2 −2 −2 (𝑃 ′ = 𝑃) P is symmetric matrix
2 2 2
−1 1 2 −4 −5 2 −5 −4 4 5
[− 2 −2 2 ]
−5 3
0 −
3 −2 −4 3 3 −1 0 −5 −3 2 2
1 1 1 5
Q= (𝐴 − 𝐴′ )= [[ 3 −2 −5] − [−2 −2 1 ]]= [5 0 −6] = 0 −3 (𝑄 ′ = −𝑄) Q is skew symmetric matrix & P+ Q
2 2 2 2
−1 1 2 −4 −5 2 3 6 0 3
[2 3 0]
1 5 −5 3
3 − 0 −
2 2 2 2 3 −2 −4
1 5
= 2 −2 −2 + 0 −3 =[ 3 −2 −5] = 𝐴
2
5 3 −1 1 2
[− 2 −2 2 ] [ 2 3 0]
2.Using matrix method solve the following system of equations : X+2y-3z=-4, 2x+3y-2z=2, 3x-3y+4z=9 { Ans. x=1,y=2,z=3}
1 −1 0 2 2 −4
3. Find the product AB where A=[2 3 4] , B=[−4 2 −4] and use the product to solve the system of equations
0 1 2 2 −1 5
x-y=3 , 2x+3y+4z=17 , y+2z=7
1 −1 0 2 2 −4 6 0 0
1
Solution: [2 3 4] [−4 2 −4] =[0 6 0] =6I, e.g. A-1 = 𝐵 → system of equation can be written as AX=B and X= A-1B
6
0 1 2 2 −1 5 0 0 6
𝑥 2 2 −4 3 12 2
1 1
[𝑦]= [−4 2 −4] [17] = [−6]=[−1] Hence x=2, y=-1, z=4
6 6
𝑧 2 −1 5 7 24 4
1 3 2
4. If A=[2 0 −1], then show that 𝐴3 − 4𝐴2 − 3𝐴 + 11𝐼 = 𝑂
1 2 3
1 3 2 1 3 2 9 7 5 9 7 5 1 3 2 28 37 26
Solution: A2 =[2 0 −1] [2 0 −1]=[1 4 1], A3 = A2A= [1 4 1] [2 0 −1]=[10 5 1]→
1 2 3 1 2 3 8 9 9 8 9 9 1 2 3 35 42 34
28 37 26 9 7 5 1 3 2 1 0 0
A3-4A2-3A+11I=[10 5 1 ] − 4 [1 4 1] − 3 [2 0 −1] + 11 [0 1 0]
35 42 34 8 9 9 1 2 3 0 0 1
28 37 26 36 28 20 3 9 6 11 0 0 0 0 0
=[10 5 1 ] − [ 4 16 4 ] − [6 0 −3] + [ 0 11 0 ] = [0 0 0]=O
35 42 34 32 36 36 3 6 9 0 0 11 0 0 0
Submitted by: S S Shishodia (M.Tech. M.Sc. )HOD Maths, Mayoor School Noida