Engineering-Mathematics Wew-Kanodia PDF

Eighth Edition
GATE
Engineering Mathematics
RK Kanodia
Ashish Murolia
NODIA & COMPANY

GATE Electronics & Communication Vol 2, 8e
Engineering Mathematics
RK Kanodia and Ashish Murolia
Copyright By NODIA & COMPANY
Information contained in this book has been obtained by author, from sources believes to be reliable. However,
neither NODIA & COMPANY nor its author guarantee the accuracy or completeness of any information herein,
and NODIA & COMPANY nor its author shall be responsible for any error, omissions, or damages arising out of
use of this information. This book is published with the understanding that NODIA & COMPANY and its author
are supplying information but are not attempting to render engineering or other professional services.
MRP 490.00
NODIA & COMPANY

B 8, Dhanshree Ist, Central Spine, Vidyadhar Nagar, Jaipur 302039
Ph : +91 141 2101150,
www.nodia.co.in
email : enquiry@nodia.co.in
Printed by Nodia and Company, Jaipur

To Our Parents
Preface to the Series
For almost a decade, we have been receiving tremendous responses from GATE aspirants for our earlier books:
GATE Multiple Choice Questions, GATE Guide, and the GATE Cloud series. Our first book, GATE Multiple
Choice Questions (MCQ), was a compilation of objective questions and solutions for all subjects of GATE
Electronics & Communication Engineering in one book. The idea behind the book was that Gate aspirants who
had just completed or about to finish their last semester to achieve his or her B.E/B.Tech need only to practice
answering questions to crack GATE. The solutions in the book were presented in such a manner that a student
needs to know fundamental concepts to understand them. We assumed that students have learned enough of
the fundamentals by his or her graduation. The book was a great success, but still there were a large ratio of
aspirants who needed more preparatory materials beyond just problems and solutions. This large ratio mainly
included average students.
Later, we perceived that many aspirants couldnt develop a good problem solving approach in their B.E/B.Tech.
Some of them lacked the fundamentals of a subject and had difficulty understanding simple solutions. Now,
we have an idea to enhance our content and present two separate books for each subject: one for theory, which
contains brief theory, problem solving methods, fundamental concepts, and points-to-remember. The second book
is about problems, including a vast collection of problems with descriptive and step-by-step solutions that can
be understood by an average student. This was the origin of GATE Guide (the theory book) and GATE Cloud
(the problem bank) series: two books for each subject. GATE Guide and GATE Cloud were published in three
subjects only.
Thereafter we received an immense number of emails from our readers looking for a complete study package
for all subjects and a book that combines both GATE Guide and GATE Cloud. This encouraged us to present
GATE Study Package (a set of 10 books: one for each subject) for GATE Electronic and Communication
Engineering. Each book in this package is adequate for the purpose of qualifying GATE for an average student.
Each book contains brief theory, fundamental concepts, problem solving methodology, summary of formulae,
and a solved question bank. The question bank has three exercises for each chapter: 1) Theoretical MCQs, 2)
Numerical MCQs, and 3) Numerical Type Questions (based on the new GATE pattern). Solutions are presented
in a descriptive and step-by-step manner, which are easy to understand for all aspirants.
We believe that each book of GATE Study Package helps a student learn fundamental concepts and develop
problem solving skills for a subject, which are key essentials to crack GATE. Although we have put a vigorous
effort in preparing this book, some errors may have crept in. We shall appreciate and greatly acknowledge all
constructive comments, criticisms, and suggestions from the users of this book. You may write to us at rajkumar.
kanodia@gmail.com and ashish.murolia@gmail.com.
Acknowledgements
We would like to express our sincere thanks to all the co-authors, editors, and reviewers for their efforts in
making this project successful. We would also like to thank Team NODIA for providing professional support for
this project through all phases of its development. At last, we express our gratitude to God and our Family for
providing moral support and motivation.
We wish you good luck !

R. K. Kanodia
Ashish Murolia
SYLLABUS
Engineering Mathematics (EC, EE, and IN Branch )

Linear Algebra: Matrix Algebra, Systems of linear equations, Eigen values and eigen vectors.
Calculus: Mean value theorems, Theorems of integral calculus, Evaluation of definite and improper integrals, Partial
Derivatives, Maxima and minima, Multiple integrals, Fourier series. Vector identities, Directional derivatives, Line,
Surface and Volume integrals, Stokes, Gauss and Greens theorems.
Differential equations: First order equation (linear and nonlinear), Higher order linear differential equations with
constant coefficients, Method of variation of parameters, Cauchys and Eulers equations, Initial and boundary
value problems, Partial Differential Equations and variable separable method.
Complex variables: Analytic functions, Cauchys integral theorem and integral formula, Taylors and Laurent
series, Residue theorem, solution integrals.
Probability and Statistics: Sampling theorems, Conditional probability, Mean, median, mode and standard
deviation, Random variables, Discrete and continuous distributions, Poisson, Normal and Binomial distribution,
Correlation and regression analysis.
Numerical Methods: Solutions of non-linear algebraic equations, single and multi-step methods for differential
equations.
Transform Theory: Fourier transform, Laplace transform, Z-transform.
Engineering Mathematics (ME, CE and PI Branch )

Linear Algebra: Matrix algebra, Systems of linear equations, Eigen values and eigen vectors. Calculus: Functions
of single variable, Limit, continuity and differentiability, Mean value theorems, Evaluation of definite and improper
integrals, Partial derivatives, Total derivative, Maxima and minima, Gradient, Divergence and Curl, Vector
identities, Directional derivatives, Line, Surface and Volume integrals, Stokes, Gauss and Greens theorems.
Differential equations: First order equations (linear and nonlinear), Higher order linear differential equations with
constant coefficients, Cauchys and Eulers equations, Initial and boundary value problems, Laplace transforms,
Solutions of one dimensional heat and wave equations and Laplace equation.
Complex variables: Analytic functions, Cauchys integral theorem, Taylor and Laurent series.
Probability and Statistics: Definitions of probability and sampling theorems, Conditional probability, Mean, median,
mode and standard deviation, Random variables, Poisson,Normal and Binomial distributions.
Numerical Methods: Numerical solutions of linear and non-linear algebraic equations Integration by trapezoidal
and Simpsons rule, single and multi-step methods for differential equations.
********** .
CONTENTS
CHAPTER 1 MATRIX ALGEBRA

1.1 INTRODUCTION 1
1.2 MULTIPLICATION OF MATRICES 1
1.3 TRANSPOSE OF A MATRIX 2
1.4 DETERMINANT OF A MATRIX 2
1.5 RANK OF MATRIX 2
1.6 ADJOINT OF A MATRIX 3
1.7 INVERSE OF A MATRIX 3

1.7.1 Elementary Transformations 4
1.7.2 Inverse of Matrix by Elementary Transformations 4
1.8 ECHELON FORM 5
1.9 NORMAL FORM 5
EXERCISE 6
SOLUTIONS 20
CHAPTER 2 SYSTEMS OF LINEAR EQUATIONS

2.1 INTRODUCTION 39
2.2 VECTOR 39
2.2.1 Equality of Vectors 39
2.2.2 Null Vector or Zero Vector 39
2.2.3 A Vector as a Linear Combination of a Set of Vectors 40
2.2.4 Linear Dependence and Independence of Vectors 40
2.3 SYSTEM OF LINEAR EQUATIONS 40
2.4 SOLUTION OF A SYSTEM OF LINEAR EQUATIONS 40
EXERCISE 42
SOLUTIONS 51
CHAPTER 3 EIGENVALUES AND EIGENVECTORS

3.1 INTRODUCTION 65
3.2 EIGENVALUES AND EIGEN VECTOR 65
3.3 DETERMINATION OF EIGENVALUES AND EIGENVECTORS 66
3.4 CAYLEY-HAMILTON THEOREM 66

3.4.1 Computation of the Inverse Using Cayley-Hamilton Theorem 67
3.5 REDUCTION OF A MATRIX TO DIAGONAL FORM 67
3.6 SIMILARITY OF MATRICES 68
EXERCISE 69
SOLUTIONS 80
CHAPTER 4 LIMIT, CONTINUITY AND DIFFERENTIABILITY

4.1 INTRODUCTION 99
4.2 LIMIT OF A FUNCTION 99

4.2.1 Left Handed Limit 99
4.2.2 Right Handed Limit 99
4.2.3 Existence of Limit at Point 100
4.2.4 L hospitals Rule 100
4.3 CONTINUITY OF A FUNCTION 100
4.3.1 Continuity in an interval 100
4.4 DIFFERENTIABILITY 101
EXERCISE 102
SOLUTIONS 115
CHAPTER 5 MAXIMA AND MINIMA

5.1 INTRODUCTION 139
5.2 MONOTONOCITY 139
5.3 MAXIMA AND MINIMA 139
EXERCISE 140
SOLUTIONS 147
CHAPTER 6 MEAN VALUE THEOREM

6.2 ROLLES THEOREM 163
6.3 LAGRANGES MEAN VALUE THEOREM 163
6.4 CAUCHYS MEAN VALUES THEOREM 163
EXERCISE 164
SOLUTIONS 168
CHAPTER 7 PARTIAL DERIVATIVES

7.2 PARTIAL DERIVATIVES 175

7.2.1 Partial Derivatives of Higher Orders 175
7.3 TOTAL DIFFERENTIATION 176
7.4 CHANGE OF VARIABLES 176

7.5 DIFFERENTIATION OF IMPLICIT FUNCTION 176
7.6 EULERS THEOREM 176
EXERCISE 177
SOLUTIONS 182
CHAPTER 8 DEFINITE INTEGRAL

8.2 DEFINITE INTEGRAL 191
8.3 IMPORTANT FORMULA FOR DEFINITE INTEGRAL 192
8.4 DOUBLE INTEGRAL 192
EXERCISE 193
SOLUTIONS 202
CHAPTER 9 DIRECTIONAL DERIVATIVES

9.2 DIFFERENTIAL ELEMENTS IN COORDINATE SYSTEMS 223
9.3 DIFFERENTIAL CALCULUS 223
9.4 GRADIENT OF A SCALAR 224
9.5 DIVERGENCE OF A VECTOR 224
9.6 CURL OF A VECTOR 225
9.7 CHARACTERIZATION OF A VECTOR FIELD 225
9.8 LAPLACIAN OPERATOR 225
9.9 INTEGRAL THEOREMS 226

9.9.1 Divergence theorem 226
9.9.2 Stokes Theorem 226
9.9.3 Greens Theorem 226
9.9.4 Helmholtzs Theorem 226
EXERCISE 227
SOLUTIONS 234
CHAPTER 10 FIRST ORDER DIFFERENTIAL EQUATIONS

10.2 DIFFERENTIAL EQUATION 247

10.2.1 Ordinary Differential Equation 247
10.2.2 Order of a Differential Equation 248
10.2.3 Degree of a Differential Equation 248
10.3 DIFFERENTIAL EQUATION OF FIRST ORDER AND FIRST DEGREE 248
10.4 SOLUTION OF A DIFFERENTIAL EQUATION 249
10.5 VARIABLES SEPARABLE FORM 249

10.5.1 Equations Reducible to Variable Separable Form 250
10.6 HOMOGENEOUS EQUATIONS 250
10.6.1 Equations Reducible to Homogeneous Form 251
10.7 LINEAR DIFFERENTIAL EQUATION 252
10.7.1 Equations Reducible to Linear Form 253
10.8 BERNOULLIS EQUATION 253
10.9 EXACT DIFFERENTIAL EQUATION 254

10.9.1 Necessary and Sufficient Condition for Exactness 254
10.9.2 Solution of an Exact Differential Equation 254
10.9.3 Equations Reducible to Exact Form: Integrating Factors 255
10.9.4 Integrating Factors Obtained by Inspection 255
EXERCISE 257
SOLUTIONS 266
CHAPTER 11 HIGHER ORDER DIFFERENTIAL EQUATIONS

11.2 LINEAR DIFFERENTIAL EQUATION 283

11.2.1 Operator 283
11.2.2 General Solution of Linear Differential Equation 283
11.3 DETERMINATION OF COMPLEMENTARY FUNCTION 284
11.4 PARTICULAR INTEGRAL 285

11.4.1 Determination of Particular Integral 285
11.5 HOMOGENEOUS LINEAR DIFFERENTIAL EQUATION 287
11.6 EULER EQUATION 288
EXERCISE 289
SOLUTIONS 300
CHAPTER 12 INITIAL AND BOUNDARY VALUE PROBLEMS

12.2 INITIAL VALUE PROBLEMS 317
12.3 BOUNDARY-VALUE PROBLEM 317
EXERCISE 319
SOLUTIONS 325
CHAPTER 13 PARTIAL DIFFERENTIAL EQUATION

13.2 PARTIAL DIFFERENTIAL EQUATION 337

13.2.1 Partial Derivatives of First Order 337
13.2.2 Partial Derivatives of Higher Order 338
13.3 HOMOGENEOUS FUNCTIONS 339
13.4 EULERS THEOREM 339
13.5 COMPOSITE FUNCTIONS 340
13.6 ERRORS AND APPROXIMATIONS 341
EXERCISE 342
SOLUTIONS 347
CHAPTER 14 ANALYTIC FUNCTIONS

14.2 BASIC TERMINOLOGIES IN COMPLEX FUNCTION 357
14.3 FUNCTIONS OF COMPLEX VARIABLE 358
14.4 LIMIT OF A COMPLEX FUNCTION 358
14.5 CONTINUITY OF A COMPLEX FUNCTION 359
14.6 DIFFERENTIABILITY OF A COMPLEX FUNCTION 359

14.6.1 Cauchy-Riemann Equation: Necessary Condition for Differentiability of a Complex
Function 360
14.6.2 Sufficient Condition for Differentiability of a Complex Function 361
14.7 ANALYTIC FUNCTION 362
14.7.1 Required Condition for a Function to be Analytic 362
14.8 HARMONIC FUNCTION 363
14.8.1 Methods for Determining Harmonic Conjugate 363
14.8.2 Milne-Thomson Method 364
14.8.3 Exact Differential Method 366
14.9 SINGULAR POINTS 366
EXERCISE 367
SOLUTIONS 380
CHAPTER 15 CAUCHYS INTEGRAL THEOREM

15.2 LINE INTEGRAL OF A COMPLEX FUNCTION 405

15.2.1 Evaluation of the Line Integrals 405
15.3 CAUCHYS THEOREM 406
15.3.1 Cauchys Theorem for Multiple Connected Region 407
15.4 CAUCHYS INTEGRAL FORMULA 408
15.4.1 Cauchys Integral Formula for Derivatives 409
EXERCISE 410
SOLUTIONS 420
CHAPTER 16 TAYLORS AND LAURENT SERIES

16.2 TAYLORS SERIES 439
16.3 MACLAURINS SERIES 440
16.4 LAURENTS SERIES 441
16.5 RESIDUES 443

16.5.1 The Residue Theorem 443
16.5.2 Evaluation of Definite Integral 443
EXERCISE 444
SOLUTIONS 453
CHAPTER 17 PROBABILITY
17.2 SAMPLE SPACE 469
17.3 EVENT 469

17.3.1 Algebra of Events 470
17.3.2 Types of Events 470
17.4 DEFINITION OF PROBABILITY 471
17.4.1 Classical Definition 471
17.4.2 Statistical Definition 472
17.4.3 Axiomatic Definition 472
17.5 PROPERTIES OF PROBABILITY 472
17.5.1 Addition Theorem for Probability 472
17.5.2 Conditional Probability 473
17.5.3 Multiplication Theorem for Probability 473
17.5.4 Odds for an Event 473
17.6 BAYES THEOREM 474
EXERCISE 476
SOLUTIONS 491
CHAPTER 18 RANDOM VARIABLE

18.2 RANDOM VARIABLE 515

18.2.1 Discrete Random Variable 516
18.2.2 Continuous Random Variable 516
18.3 EXPECTED VALUE 517
18.3.1 Expectation Theorems 517
18.4 MOMENTS OF RANDOM VARIABLES AND VARIANCE 518
18.4.1 Moments about the Origin 518
18.4.2 Central Moments 518
18.4.3 Variance 518
18.5 BINOMIAL DISTRIBUTION 519
18.5.1 Mean of the Binomial distribution 519
18.5.2 Variance of the Binomial distribution 519
18.5.3 Fitting of Binomial Distribution 520
18.6 POISSON DISTRIBUTION 521
18.6.1 Mean of Poisson Distribution 521
18.6.2 Variance of Poisson Distribution 521
18.6.3 Fitting of Poisson Distribution 522
18.7 NORMAL DISTRIBUTION 522
18.7.1 Mean and Variance of Normal Distribution 523
EXERCISE 526
SOLUTIONS 533
CHAPTER 19 STATISTICS
19.2 MEAN 543
19.3 MEDIAN 544
19.4 MODE 545
19.5 MEAN DEVIATION 545
19.6 VARIANCE AND STANDARD DEVIATION 546
EXERCISE 547
SOLUTIONS 550
CHAPTER 20 CORRELATION AND REGRESSION ANALYSIS

20.2 CORRELATION 555
20.3 MEASURE OF CORRELATION 555

20.3.1 Scatter or Dot Diagrams 555
20.3.2 Karl Pearsons Coefficient of Correlation 556
20.3.3 Computation of Correlation Coefficient 557
20.4 RANK CORRELATION 558
20.5 REGRESSION 559

20.5.1 Lines of Regression 559
20.5.2 Angle between Two Lines of Regression 560
EXERCISE 562
SOLUTIONS 565
CHAPTER 21 SOLUTIONS OF NON-LINEAR ALGEBRAIC EQUATIONS

21.2 SUCCESSIVE BISECTION METHOD 569

21.3 FALSE POSITION METHOD (REGULA-FALSI METHOD) 569
21.4 NEWTON - RAPHSON METHOD (TANGENT METHOD) 570
EXERCISE 21 571
SOLUTIONS 21 579
CHAPTER 22 INTEGRATION BY TRAPEZOIDAL AND SIMPSONS RULE

22.2 NUMERICAL DIFFERENTIATION 597

22.2.1 Numerical Differentiation Using Newtons Forward Formula 597
22.2.2 Numerical Differentiation Using Newtons Backward Formula 598
22.2.3 Numerical Differentiation Using Central Difference Formula 599
22.3 MAXIMA AND MINIMA OF A TABULATED FUNCTION 599
22.4 NUMERICAL INTEGRATION 600

22.4.1 Newton-Cotes Quadrature Formula 600
22.4.2 Trapezoidal Rule 601
22.4.3 Simpsons One-third Rule 601
22.4.4 Simpsons Three-Eighth Rule 602
EXERCISE 604
SOLUTIONS 608
CHAPTER 23 SINGLE AND MULTI STEP METHODS FOR DIFFERENTIAL EQUATIONS

23.2 PICARDS METHOD 617
23.3 EULERS METHOD 618

23.3.1 Modified Eulers Method 618
23.4 RUNGE-KUTTA METHODS 619
23.4.1 Runge-Kutta First Order Method 619
23.4.2 Runge-Kutta Second Order Method 619
23.4.3 Runge-Kutta Third Order Method 619
23.4.4 Runge-Kutta Fourth Order Method 620
23.5 MILNES PREDICTOR AND CORRECTOR METHOD 620
23.6 TAYLORS SERIES METHOD 621
EXERCISE 623
SOLUTIONS 628
***********
GATE Engineering Mathematics EC, EE, ME, CE, PI, IN
Sample Chapter of Engineering Mathematics
CHAPTER 1
Page 1
Chap 1
Matrix Algebra
MATRIX ALGEBRA
1.1 INTRODUCTION
This chapter, concerned with the matrix algebra, includes the following
topics:
Multiplication of matrix
Transpose of matrix
in
Determinant of matrix
.
Rank of matrix
co
Adjoint of matrix
.
Inverse of matrix: elementary transformation, determination of inverse
ia
using elementary transformation
od
Echelon form and normal form of matrix; procedure for reduction of
normal form.
1.2 .n
MULTIPLICATION OF MATRICES
ww
If A and B be any two matrices, then their product AB will be defined
If
and
w
only when number of columns in A is equal to the number of rows in B .
A = 6aij@m # n
B = 6bjk @n # p
then their product,
AB = C = 6cik@m # p
will be matrix of order m # p , where
n
cik = / aij bjk
j=1
PROPERTIES OF MATRIX MULTIPLICATION
If A, B and C are three matrices such that their product is defined, then
1. Generally not commutative; AB ! BA
2. Associative law; (AB) C = A (BC)
3. Distributive law; A (B + C) = AB + AC
4. Cancellation law is not applicable, i.e. if AB = AC , it does not mean
that B = C .
5. If AB = 0 , it does not mean that A = 0 or B = 0 .
6. (AB)T = (BA)T
Buy Online: shop.nodia.co.in

*Shipping Free* *Maximum Discount*

Page 2 1.3 TRANSPOSE OF A MATRIX
Chap 1
Matrix Algebra The matrix obtained form a given matrix A by changing its rows into
columns or columns int rows is called Transpose of matrix A and is denoted
by AT . From the definition it is obvious that if order of A is m # n , then
order of AT is n # m .
PROPERTIES OF TRANSPOSE OF MATRIX
Consider the two matrices A and B

1. (AT )T = A
2. (A ! B)T = AT ! BT
3. (AB)T = BT AT
4. (kA)T = k (A)T
5. (A1 A2 A 3 ...An - 1 An)T = A Tn A Tn - 1 ...A T3 A T2 A T1
1.4 DETERMINANT OF A MATRIX
The determinant of square matrix A is defined as

a11 a12 a13 i. n
A = a21 a22 a23
a31 a32 a33
.c o
i a
PROPERTIES OF DETERMINANT OF MATRIX
o d
Consider the two matrices A and B .
1. A exists + A is a square matrix
.
2. AB = A B
n
3.
w w AT = A
4. kA = kn A , if A is a square matrix of order n .
w 5. If A and B are square matrices of same order then AB = BA .

6. If A is a skew symmetric matrix of odd order then A = 0 .
7. If A = diag (a1, a2,...., an) then A = a1, a2 ...an .
8. A n = An , n ! N .
9. If A = 0 , then matrix is called singular.
Singular Matrix
A square matrix A is said to be singular if A = 0 and non-singular if
A ! 0.
1.5 RANK OF MATRIX
The number, r with the following two properties is called the rank of the
matrix
1. There is at least one non-zero minor of order r .
2. Every minor of order (r + 1) is zero.
This definition of the rank does uniquely fix the same for, as a consequence
of the condition (2), every minor of order (r + 2), being the sum of multiples
of minors of order (r + 1), will be zero. In fact, every minor of order greater


than r will be zero as a consequence of the condition (2). Page 3
The given following two simple results follow immediately from the definition Chap 1
1. There exists a non-zero minor or order r & the rank is $ r . Matrix Algebra
2. All minors of order (r + 1) are zero & the rank is # r .

In each of the two cases above, we assume r to satisfy only one of two
properties (1) or (2) of the rank. The rank of matrix A represented by
symbol r (A) .
Nullity of a Matrix
If A is a square matrix of a order n, then n - r (A) is called the nullity of
the matrix A and is denoted by N (A). Thus a non-singular square matrix of
order n has rank equal to n and the nullity of such a matrix is equal to zero.
1.6 ADJOINT OF A MATRIX
If every element of a square matrix A be replaced by its cofactor in A ,

then the transpose of the matrix so obtained is called the Adjoint of matrix
A and it is denoted by adj A. Thus, if A = 6aij @ be a square matrix and Fij
in
be the cofactor of aij in A , then adj A + 6Fij @T .
.
.co
PROPERTIES OF ADJOINT MATRIX
If A, B are square matrices of order n ad In is corresponding unit matrix,

then
ia
od
1. A (adj A) = A In = (adj A)A
2. adj A = A n - 1
4. n
3. adj (adj A) = A n - 2 A
.
adj (adj A) = A (n - 1)
2
ww
5. adj (AT ) = (adj A)T
6. adj (AB) = (adj B) (adj A)
w
7. adj (Am) = (adj A) m, m ! N
8. adj (kA) = kn - 1 (adj A), k ! R
1.7 INVERSE OF A MATRIX
If A and B are two matrices such that AB = I = BA, then B is called the
inverse of A and it is denoted by A-1 . Thus,
A-1 = B + AB = I = BA
To find inverse matrix of a given matrix A we use following formula
adj A
A-1 =
A
Thus A-1 exists if A ! 0 and matrix A is called invertible.


Page 4
PROPERTIES OF INVERSE MATRIX
Chap 1
Matrix Algebra Let A and B are two invertible matrices of the same order, then
1. (AT ) -1 = (A-1)T
2. (AB) -1 = B-1 A-1
3. (Ak ) -1 = (A-1) k , k ! N
4. adj (A-1) = (adj A) -1
5. A-1 = 1 = A -1
A
6. If A = diag (a1, a2,..., an), then A-1 = diag (a 1-1, a 2-1, ..., a n-1)
7. AB = AC & B = C , if A ! 0
1.7.1 Elementary Transformations

Any one of the following operations on a matrix is called an elementary
transformation (or E -operation).
1. Interchange of two rows or two columns
i. n
(1) The interchange of i th and j th rows is denoted by Ri ) R j
(2) The interchange of i th and j th columns is denoted by Ci ) C j .
.c o
2. Multiplication of (each element ) a row or column by a k.
a
th
(1) The multiplication of i row by k is denoted by Ri " kRi
i
(2) The multiplication of i th column by k is denoted by Ci " kCi
o d
3. Addition of k times the elements of a row (or column) to the corresponding
. n
elements of another row (or column), k ! 0
(1) The addition of k times the j th row to the i th row is denoted by
w wRi " Ri + kR j .
(2) The addition of k times the j th column to the i th column is denoted by
w Ci " Ci + kC j .
If a matrix B is obtained from a matrix A by one or more E -operations,
then B is said to be equivalent to A. They can be written as A + B .
1.7.2 Inverse of Matrix by Elementary Transformations

The elementary row transformations which reduces a square matrix A to
the unit matrix, when applied to the unit matrix, gives the inverse matrix
A-1 . Let A be a non-singular square matrix. Then,
A = IA
Apply suitable E -row operations to A on the left hand side so that A
is reduced to I . Simultaneously, apply the same E -row operations to the
pre-factor I on right hand side. Let I reduce to B, so that I = BA. Post-
multiplying by A-1 , we get
IA-1 = BAA-1
or A-1 = B (AA-1) = BI = B
or B = A-1


1.8 ECHELON FORM Page 5
Chap 1
A matrix is said to be of Echelon form if, Matrix Algebra
1. Every row of matrix A which has all its entries 0 occurs below every row
which has a non-zero entry.
2. The first non-zero entry in each non-zero is equal to one.
3. The number of zeros before the first non-zero element in a row is less
than the number of such zeros in the next row.
Rank of a matrix in the Echelon form

The rank of a matrix in the echelon form is equal to the number of non-zero
rows of the given matrix. For example,
R0 2 6 1V
S W
the rank of the matrix A = S0 0 1 2W is 2
SS0 0 0 0WW
T X 3#4
1.9 NORMAL FORM
.in
By a finite number of elementary transformations, every non-zero matrix
forms.
.co
A of order m # n and rank r (> 0) can be reduced to one of the following
Ir O Ir
> O O H, > O H, 8Ir OB, 8IrB
ia
od
Ir denotes identity matrix of order r . Each one of these four forms is called
Normal Form or Canonical Form or Orthogonal Form.
.n
Procedure for Reduction of Normal Form
Let A = 6aij@ be any matrix of order m # n . Then, we can reduce it to the
ww
normal form of the matrix A by subjecting it to a number of elementary
transformation using following methodology.
w
METHODOLOGY: REDUCTION OF NORMAL FORM
1. We first interchange a pair of rows (or columns), if necessary, to obtain

a non-zero element in the first row and first column of the matrix A.
2. Divide the first row by this non-zero element, if it is not 1.
3. We subtract appropriate multiples of the elements of the first row
from other rows so as to obtain zeroes in the remainder of the first
column.
4. We subtract appropriate multiple of the elements of the first column
from other columns so as to obtain zeroes in the remainder of the first
row.
5. We repeat the above four steps starting with the element in the second
row and the second column.
6. Continue this process down the leading diagonal until the end of the
diagonal is reached or until all the remaining elements in the matrix
are zero.
***********


Page 6
Chap 1 EXERCISE 1
Matrix Algebra
QUE 1.1 Match the items in column I and II.
Column I Column II
P. Singular matrix 1. Determinant is not defined
Q. Non-square matrix 2. Determinant is always one
R. Real symmetric 3. Determinant is zero
S. Orthogonal matrix 4. Eigenvalues are always real
5. Eigenvalues are not defined
(A) P-3, Q-1, R-4, S-2

(B) P-2, Q-3, R-4, S-1 i. n
(C) P-3, Q-2, R-5, S-4
(D) P-3, Q-4, R-2, S-1
.c o
i a
QUE 1.2
o d
Cayley-Hamilton Theorem states that a square matrix satisfies its own
n
characteristic equation. Consider a matrix
. A=>
-3 2
- 2 0H
ARIHANT/286/26
w w
If A be a non-zero square matrix of orders n , then
(A) the matrix A + Al is anti-symmetric, but the matrix A - Al is
w symmetric
(B) the matrix A + Al is symmetric, but the matrix A - Al is anti-
symmetric
(C) Both A + Al and A - Al are symmetric
(D) Both A + Al and A - Al are anti-symmetric
QUE 1.3 If A and B are two odd order skew-symmetric matrices such that AB = BA
ARIHANT/285/3
, then what is the matrix AB ?
(A) An orthogonal matrix
(B) A skew-symmetric matrix
(C) A symmetric matrix
(D) An identity matrix
QUE 1.4 If A and B are matrices of order 4 # 4 such that A = 5B and A = a B

, then a is_______.


QUE 1.5 If the rank of a ^5 # 6h matrix A is 4, then which one of the following Page 7
ARIHANT/292/117 statements is correct?
Chap 1
(A) A will have four linearly independent rows and four linearly independent Matrix Algebra
columns
(B) A will have four linearly independent rows and five linearly independent
columns
(C) AAT will be invertible
(D) AT A will be invertible
QUE 1.6 If An # n is a triangular matrix then det A is

n n
(A) % (- 1) aii (B) % aii
i=1 i=1
n n
(C) / (- 1) aii (D) / aii
i=1 i=1
QUE 1.7
.in
If A ! Rn # n, det A ! 0 , then A is
.co
(A) non singular and the rows and columns of A are linearly independent.
(B) non singular and the rows A are linearly dependent.
(D) singular
ia
(C) non singular and the A has one zero rows.
od
QUE 1.8
.n
Square matrix A of order n over R has rank n . Which one of the following
ARIHANT/286/28
w
statement is not correct?
(A) AT has rank n
w
(B) A has n linearly independent columns
w
(C) A is non-singular
(D) A is singular
R V
S5 3 2 W
QUE 1.9 Determinant of the matrix S1 2 6 W is_____
SS3 5 10 WW
T X
QUE 1.10 The value of the determinant

ARIHANT/305/7 a h g
h b f
g f c
(A) abc + 2fgh - af 2 - bg2 - ch2
(B) ab + a + c + d
(C) abc + ab - bc - cg
(D) a + b + c


Page 8 67 19 21
Chap 1 QUE 1.11 The value of the determinant 39 13 14 is______
Matrix Algebra ARIHANT/306/9 81 24 26
R V
1 3 2 S2 7 8W
QUE 1.12 If 0 5 - 6 = 26 , then the determinant of the matrix S0 5 - 6 W is____
2 7 8 SS1 3 2 WW
T X
R 0 1 0 2 VW
S
S- 1 1 1 3W
QUE 1.13 The determinant of the matrix S is______
0 0 0 1W
S W
S 1 -2 0 1W
T X
QUE 1.14 Let A be an m # n matrix and B an n # m matrix. It is given that
i. n
determinant Îm + AB h = determinant În + BAh, where Ik is the k # k
identity matrix. Using the above property, the determinant of the matrix
given below is______
R
S2 1 1 1W
S1 2 1 1W
V
.c o
S1 1 2 1W
S W
i a
S1 1 1 2W
T X
o d
. n
QUE 1.15
ARIHANT/306/14
w w
Let A = >
3 1 - 2i
1 - 2i 2
3 1 - 2i
H, then
2 1 + 2i
w (1) A = >
1 + 2i
(3) A * = A
2
H (2) A * = >
1 - 2i 2
H
(4) A is hermitian matrix

Which of above statement is/are correct ?
(A) 1 and 3 (B) 1, 2 and 3
(C) 1 and 4 (D) All are correct
QUE 1.16 For which value of l will the matrix given below become singular?
R V
ARIHANT/292/110
S 8 l 0W
S 4 0 2W
SS12 6 0WW
T X
R V
S 0 1 - 2W
QUE 1.17 If S- 1 0 3 W is a singular, then l is______
SS 2 - 2 l WW
T X


QUE 1.18 Multiplication of matrices E and F is G . matrices E and G are Page 9
Rcos q - sin q 0VW R1 0 0V
S S W Chap 1
E = S sin q cos q 0W and G = S0 1 0W Matrix Algebra
SS 0 0 1WW SS0 0 1WW
T X T X
What is the matrix F ?
Rcos q - sin q 0V R cos q cos q 0V
S W S W
(A) S sin q cos q 0W (B) S- cos q sin q 0W
SS 0 0 1WW SS 0 0 1WW
RT cos q sin q 0XV TR VX
S W S sin q - cos q 0W
(C) S- sin q cos q 0W (D) Scos q sin q 0W
SS 0 0 1WW SS 0 0 1WW
T X T X
1 2 3 4
Rank of matrix =
- 2 0 5 7G
QUE 1.19 is
.in R
S1 1 1 W
V
QUE 1.20
.co
The rank of the matrix S1 - 1 0 W is______
SS1 1 1 WW
ia T X
QUE 1.21 Given,

od
ARIHANT/306/8
.n R
S1 2 3W
A = S1 4 2W
V
ww
(1) A = 0
SS2 6 5WW
T X
(2) A = Y 0
(3) rank Âh = 2 (4) rank Âh = 3
w
(A) 1, 3 and 4 (B) 1 and 3
(C) 1, 2 and 4 (D) 2 and 4
R V
S2 1 - 1W
QUE 1.22 Given, A = S0 3 - 2W is
ARIHANT/306/11 SS2 4 - 3WW
(1) A = 0 T X (3) A = Y 0
(3) rank Âh = 2 (4) rank Âh = 5
(A) 1, 3 and 4 (B) 1 and 3
(C) 1, 2 and 4 (D) 2 and 4
R V
S4 2 1 3W
QUE 1.23 Given matrix 6A@ = S6 3 4 7W, the rank of the matrix is_____
ARIHANT/292/111 SS2 1 0 1WW
T X


Page 10 R2 - 1 3V
S W
Chap 1 QUE 1.24 The rank of the matrix A = S4 7 lW is 2. The value of l must be
Matrix Algebra SS1 4 5WW
T X
R1 2 3 0 VW
S
S2 4 3 2W
QUE 1.25 The rank of matrix S is______
3 2 1 3W
S W
S6 8 7 5W
T X
QUE 1.26 Given,

ARIHANT/306/10
1 a b 0
0 c d 1
A=
1 a b 0
0 c d 1
(1) A = 0 (2) Two rows are identical
(3) rank Âh = 2
Which of above statement is/are correct ? i. n
(4) rank Âh = 3
(A) 1, 3 and 4
(C) 1, 2 and 3
.c o
(B) 1 and 3
(D) 2 and 4
i a
QUE 1.27
o d
Two matrices A and B are given below :
. n A =>
p q
r s H ; B=>
p2 + q2 pr + qs
pr + qs r2 + s2
H
w w
If the rank of matrix A is N , then the rank of matrix B is
(A) N/2 (B) N - 1
w (C) N (D) 2N
QUE 1.28 If x, y, z are in AP with common difference d and the rank of the matrix
R V
S4 5 x W
ARIHANT/286/27
S5 6 y W is 2, then the value of d and k are

SS6 k z WW
T d =X x/2 ; k is an arbitrary number
(A)
(B) d an arbitrary number; k = 7
(C) d = k ; k = 5
(D) d = x/2 ; k = 6
QUE 1.29 The rank of a 3 # 3 matrix C = AB , found by multiplying a non-zero

column matrix A of size 3 # 1 and a non-zero row matrix B of size 1 # 3 , is
(A) 0 (B) 1
(C) 2 (D) 3


Rx y 1V
S 1 1 W Page 11
QUE 1.30 If A = Sx2 y2 1W and the point (x1, y1),( y2, y2),( x3, y2) are collinear, then the Chap 1
SSx y 1WW Matrix Algebra
3 3
T X
rank of matrix A is
(A) less than 3 (B) 3
(C) 1 (D) 0
QUE 1.31 Let A = [aij ], 1 # i, j # n with n $ 3 and aij = i.j Then the rank of A is
(A) 0 (B) 1
(C) n - 1 (D) n
QUE 1.32 Let P be a matrix of order m # n , and Q be a matrix of order n # p, n ! p .

If r (P) = n and r (Q) = p , then rank r (PQ) is
in
(A) n (B) p
(C) np
o. (D) n + p
QUE 1.33
a.c
x = 8x1 x2 g xnBT is an n-tuple nonzero vector. The n # n matrix
V = xxT
di
(A) has rank zero (B) has rank 1
no
(C) is orthogonal (D) has rank n
w.
QUE 1.34
R
w
If x, y, z in A.P. with common difference d and the rank of the matrix
S4 5 x W
w
V
S5 6 y W is 2, then the values of d and k are respectively
SS6 k z WW
T X
(A) x and 7 (B) 7, and x
4 4
(C) x and 5 (D) 5, and x

7 7
QUE 1.35 If the rank of a (5 # 6) matrix Q is 4, then which one of the following
statement is correct ?
(A) Q will have four linearly independent rows and four linearly independent
columns
(B) Q will have four linearly independent rows and five linearly independent
columns
T
(C) QQ will be invertible
(D) QT Q will be invertible


Page 12 1 -4
The adjoint matrix of =
0 2G
Chap 1
QUE 1.36 is
Matrix Algebra 4 2 1 0
(A) = G (B) =
0 1 4 2G
2 4 2 4
(C) = G (D) =
1 0 0 1G
x y
QUE 1.37 If A = > H, then adj(adj A) is equal to
z b
b -z b z
(A) =
-y x G
(B) =
y xG
(C) 1 = b yG (D) None of these

xb - yz - y x
i. n
QUE 1.38 If A is a 3 # 3 matrix and A = 2 then A (adj A) is equal to
R V R V
S4 0 0W S2 0 0 W
(A) S0 4
SS0 0
RT
S1 0
0W
4W
0W
W
VX
.c o (B) S0 2 0 W
SS0 0 2 WW
TR1 XV
S2 0 0 W
(C) S0 1 0W
i a (D) S0 12 0 W
SS0 0
T
1WW
X
o d SS0 0 1 WW
T
2
X
. n
QUE 1.39
w w
If A is a 2 # 2 non-singular square matrix, then adj(adj A) is
(A) A2
(C) A -1
(B) A
(D) None of the above
w
Common Data For Q. 40 to 42
If A is a 3 - rowed square matrix such that A = 3 .
QUE 1.40 The adj(adj A) is equal to

(A) 3A (B) 9A
(C) 27A (D) 81A
QUE 1.41 The value of adj (ajd A) is equal to

(A) 3 (B) 9
(C) 27 (D) 81
QUE 1.42 The value of adj (adj A2) is equal to

(A) 3 4 (B) 38
(C) 316 (D) 332


QUE 1.43 The rank of an n row square matrix A is (n - 1), then Page 13
(A) adjA ! 0 (B) adjA = 0 Chap 1
(C) adjA = In (D) adjA = In - 1 Matrix Algebra
R- 1 - 2 - 2V
S W
QUE 1.44 The adjoint of matrix A = S 2 1 - 2W is equal to
SS 2 - 2 1WW
(A) A T X (B) 3A
(C) 3AT (D) A t
QUE 1.45 The matrix, that has an inverse is

3 1 5 2
(A) = G (B) = G
6 2 2 1
6 2 8 2
(C) = G (D) = G
in
9 3 4 1
o.
QUE 1.46
a.c
The inverse of the matrix A = >
-1 2
3 - 5H
is
5 2
(A) = G
3 1
di (B) =
5 -3
3 1G
(C) =
-5 -2
-3 -1
noG
5 3
(D) = G
w. 2 1
QUE 1.47
ww 1 2
The inverse of the 2 # 2 matrix = G is
5 7
-7 2 7 2
(A) 1 = G (B) 1 = G
3 5 -1 3 5 1
7 -2 -7 -2
(C) 1 = G (D) 1 = G
3 -5 1 3 -5 -1
3 4
QUE 1.48 If B is an invertible matrix whose inverse in the matrix = G, then B is
5 6
6 -4 1
3 4
(A) = (B) > 1 H
- 5 6G 5 6
-3 2 1 1
(C) = 5 - 3 G (D) > 13 4
1 H
2 2 5 6
A B
Matrix M = >
C 0H
QUE 1.49 is an orthogonal matrix. The value of B is
(A) 1 (B) 1
2 2
(C) 1 (D) 0


Page 14 R1 2V
S W
Chap 1 QUE 1.50 If A = S2 1W then A-1 is
Matrix Algebra SS1 1WW
R TV X R V
S2 3 W S 1 - 2W
(A) S3 1 W (B) S- 2 1 W
SS2 7 WW SS 1 2 WW
RT VX T X
S1 4 W
(C) S3 2 W (D) Undefined
SS2 5 WW
T X
R1 0 0V
S W
QUE 1.51 The inverse of matrix A = S5 2 0W is equal to
SS3 1 2WW
R V T XR V
S 2 0 0W S 2 0 0W
1
(A) S- 5 2 0W 1
(B) S- 5 1 0W
4S W 2S
S- 1 - 1 2W S- 1 - 1 2 WW
R T
i. n
VX TR XV
S 1 0 0W S 4 0 0W
(C) S- 10 2 0W 1
(D) S- 10 2 0W
SS - 1 - 1
T
W
2W
X
4S
.c
T o
S-1 -1 2 WW
X
Ra b c V
i a
QUE 1.52
S W
d
If det A = 7, where A = Sd e f W then det(2A) -1 is_____
o
SSg b c WW
. T
n X
QUE 1.53
w w R1 0 - 1V
S W
If R = S2 1 - 1W, the top of R-1 is
SS2 3 2WW
w T
(A) [5, 6, 4]
(C) [2, 0, - 1]
X
(B) [5, - 3, 1]
(D) [2, - 1, 12 ]
-1 2
Let B be an invertible matrix and inverse of 7B is =
4 - 7G
QUE 1.54 , the matrix B
is
1 2 7 2
(A) > 4 71 H (B) = G
7 7 4 1
4
1 7 4
(C) > 2 H (D) =
2 1G
7
1
7 7
R V
S0 1 0 0W
S0 2 0 1W
QUE 1.55 If A = S , then det (A-1) is equal to_____
S0 3 2 0WW
S1 4 1 0W
T X


R V
S1 1 1 1W Page 15
S1 1 - 1 - 1W
W, 6AA @ is
T -1 Chap 1
QUE 1.56 Given an orthogonal matrix A = S
S1 - 1 0 0 W
Matrix Algebra
S0 0 1 - 1W
R1 V T R1 X V
S4 0 0 0 W S2 0 0 0 W
S0 1 0 0 W S0 1 0 0 W
(A) S 4 1 W (B) S 2 1 W
S0 0 2 0 W S0 0 2 0 W
1
S0 0 0 2 W S0 0 0 12 W
RT1 0 0 0 V X TR 1 XV
S W S 4 0 0 0 W
S0 1 0 0 W S0 14 0 0 W
(C) S (D) S W
0 0 1 0W S0 0 14 0 W
S W
S0 0 0 1 W S0 0 0 14 W
T X T X
QUE 1.57 Given an orthogonal matrix

R1 1 1 1 V
in
S W
S1 1 - 1 - 1W
A =S
o.
S
1 - 1 0 0W
S0 0 1 1 W
W
6AAT @ is
-1
a.c T X
i
R1 V R1 V
S4 0 0 0 W S2 0 0 0W
(A) S
o
1
d
S0 14 0 0 W
S0 0 2 0 W
W
S0
(B) S
S0
1
2 0 0
1
0 2 0W
W
W
.n
S0 0 0 12 W
RT1 0 0 0 V X
S0
TR 1
S4
0 0 12 W
0 0 0XW
V
S
S
ww
S0 1 0 0 W
(C) S
0 0 1 0W
S0 0 0 1 W
W
W
(D) S
S0
S0
S0
1
4 0 0
W
W
0 14 0 W
0 0 14 W
QUE 1.58
T
w X T X
A is m # n full rank matrix with m > n and I is identity matrix. Let matrix
Al = (AT A) -1 AT , Then, which one of the following statement is FALSE ?
(A) AAlA = A (B) (AAl) 2
(C) AlA = I (D) AAlA = Al
3 4
For a matrix 6M @ = > H, the transpose of the matrix is equal to the
5 5
QUE 1.59 3
x 5
inverse of the matrix, 6M @ = 6M @ . The value of x is given by

T -1
(A) - 4 (B) - 3
5 5
(C) 3 (D) 4
5 5
2x 0 1 0
If A = > H and A-1 >
- 1 2H
QUE 1.60 then the value of x is_____
x x


Page 16 2 -1 2
The value of =
3 2 G=1 G
Chap 1
QUE 1.61 is
Matrix Algebra
8 3
(A) = G (B) = G
3 8
(C) 8- 3, - 8B (D) [3, 8]
1 2 0
If A = >
4H
QUE 1.62 , then AAT is
3 -1
1 3 1 0 1
(A) =
- 1 4G
(B) =
- 1 2 3G
5 1
(C) =
1 26G
(D) Undefined
-2 1 -1 7
QUE 1.63 If A > H=> H, then the matrix A is equal to
3 5 - 1 20
i. n
1 2 2 1
(A) = G (B) = G
3 5 5 3
5 3
(C) = G
2 1
.c o
(D) =
-5 3
2 1G
i a
QUE 1.64 Let, A = >
2 - 0.1
0 3 H
o d 1
0 b
a
and A-1 = > 2 H. Then (a + b) =_____
. n
QUE 1.65
w w
Let A = >
(A) 7
2 - 0.1
0 3 H
1
0 b
a
and A-1 = > 2 H, Then (a + b) is
(B) 3
w 20
(C) 19
20
20
(D) 11
20
2 6 3 x
QUE 1.66 If A = > H and B = > H, then in order that AB = 0 , the values of x and
3 9 y 2
y will be respectively
(A) - 6 and - 1 (B) 6 and 1
(C) 6 and - 3 (D) 5 and 14
R1V
1 1 0 S W
QUE 1.67 If A = > H and B = S0W, the product of A and B is
1 0 1 SS1WW
1 1 0
(A) = G T X (B) = G
0 0 1
1 1 0
(C) = G (D) = G
2 0 2


R 1 2VW
1 1 2 S Page 17
QUE 1.68 If A = > H and B = S 2 0W, then (AB)T is Chap 1
2 1 0 SS- 1 1WW Matrix Algebra
1 4 1 4
(A) =
4 4G
T X (B) = G
1 4
1 4 1 1
(C) =
4 1G
(D) =
4 4G
R 2 - 1V
S W 1 -2 -5
If A = S 1 0W and B = >
3 4 0H
QUE 1.69 then AB is
SS- 3 4WW
R T X V R V
S- 1 - 8 - 10 W S 0 0 - 10 W
(A) S- 1 - 2 5W (B) S- 1 - 2 - 5 W
SS 9 22 15 WW SS 0 21 - 15 WW
RT VX TR VX
S- 1 - 8 - 10 W S0 - 8 - 10 W
(C) S 1 - 2 - 5 W (D) S1 - 2 - 5 W
in
SS 9 22 15 WW SS9 21 15 WW
T
o. X T X
R
.c V
S0 1 0 0W
a
QUE 1.70
ARIHANT/287/32
If X = S
di
S0 0 1 0W
W, then the rank of XT X , where XT denotes the transpose
S0 0 0 1W
T
o
S0 0 0 0W
n
of X , is______ X
w.
QUE 1.71
ww
Consider the matrices X(4 # 3), Y(4 # 3) and P(2 # 3) . The order of [P (XT Y)T PT ]T
will be
(A) (2 # 2) (B) (3 # 3)
(C) (4 # 3) (D) (3 # 4)
cos a sin a
If A a = >
- sin cos aH
QUE 1.72 , then consider the following statements :
1. A a .A b = A ab 2. A a .A b = A(a + b)
n
cos a sin a n
cos na sin na
3. (A a) n = > n H 4. (A a) n = >
n
- sin a cos a - sin na cos naH
Which of the above statements are true ?
(A) 1 and 2 (B) 2 and 3
(C) 2 and 4 (D) 3 and 4
0 - tan a2 cos a - sin a2

If A = > H then (I - A) >
sin a cos a H
QUE 1.73 a is equal to
tan 2 0
(A) I - 2A (B) I - A
(C) I + 2A (D) I + A


Page 18 cos q sin q
Chap 1 QUE 1.74 Let A = > H
- sin q cos q
Matrix Algebra ARIHANT/306/13
1 0
(1) AAT = > H (2) AAT = 1
0 1
(3) A is orthogonal matrix (4) A is not a orthogonal matrix
(A) 1, 3 and 4
(B) 2 and 3
(C) 1, 2 and 3
(D) 2 and 4
QUE 1.75 If the product of matrices

cos2 q cos q sin q
A == G and
cos q sin q sin2 q
cos2 f cos f sin f
B == G
cos f sin f
is a null matrix, then q and f differ by i. n
sin2 f
(A) an even multiple p2

(B) an even multiple p
.c o
(C) an odd multiple of p2
i a
(D) an odd multiple of p
o d
. n 1 1
For a given 2 # 2 matrix A, it is observed that A > H =-> H and
QUE 1.76
w w1 1
A > H =- 2 > H. The matrix A is
-2 -2
-1 -1
w (A) A = >
2 1 -1 0 1 1
- 1 - 1H> 0 - 2H>- 1 - 2H
1 1 1 0 2 1
(B) A = >
- 1 - 2H>0 2H>- 1 - 1H
1 1 -1 0 2 1
(C) A = >
- 1 - 2H> 0 - 2H>- 1 - 1H
0 -2
(D) =
1 - 3G
3 -4
If A = >
1 - 1H
QUE 1.77 , then for every positive integer n, An is equal to
1 + 2n 4n 1 - 2n - 4n
(A) =
1 + 2n G
(B) =
n n 1 + 2n G
1 - 2n 4n 1 + 2n - 4n
(C) =
1 + 2n G
(D) =
n n 1 - 2n G


R V
S3 W Page 19
QUE 1.78 For which values of the constants b and c is the vector Sb W a linear Chap 1
R VR V R V SSc WW
S1 W S2 W S- 1W Matrix Algebra
Combination of S3 W, S6 W and S- 3 W T X
SS2 WW SS4 WW SS- 2 WW
(A) 9, 6 T XT X T X (B) 6, 9
(C) 6, 6 (D) 9, 9
R V
Sa b c W
QUE 1.79 The values of non zero numbers a, b, c, d, e, f, g, h such that the matrix Sd k e W
is invertible for all real numbers k . SSf g h WW
T X
(A) finite sol n (B) infinite sol n
(C) 0 (D) none
.in ***********
.co
ia
od
.n
ww
w


Page 20
Chap 1 SOLUTIONS 1
Matrix Algebra
SOL 1.1 Correct option is (A).

(P) Singular Matrix " Determinant is zero A = 0
(Q) Non-square matrix " An m # n matrix for which m ! n , is called non-
square matrix. Its determinant is not defined
(R) Real Symmetric Matrix " Eigen values are always real.
(S) Orthogonal Matrix " A square matrix A is said to be orthogonal if
AAT = I
Its determinant is always one.
SOL 1.2 Correct option is (B).

i. n
.c o
Here, if A be a non-zero square matrix of order n , then the matrix A + Al
is symmetric, but A - Al will be anti-symmetric.
i a
SOL 1.3 Correct option is (C).
o d
If A and B are both order skew-symmetric matrices, then
. n A =- AT and B =- BT
Also, given that AB = BA
...(1)
w w = ^- BT h^- AT h
= B A = ÂB h
T T T
[from Eq. (1)]
w AB = ÂB hT i.e., AB is a symmetric matrix
SOL 1.4 Correct answer is 625.

If k is a constant and A is a square matrix of order n # n then kA = kn A .
A = 5B & A = 5B = 5 4 B = 625 B
or a = 625

If rank of ^5 # 6h matrix is 4, then surely it must have exactly 4 linearly
independent rows as well as 4 linearly independent columns.
Hence, Rank = Row rank = Column rank

From linear algebra for An # n triangular matrix det A is equal to the product
of the diagonal entries of A.


SOL 1.7 Correct option is (B). Page 21
If det A ! 0, then An # n is non-singular, but if An # n is non-singular, then Chap 1
no row can be expressed as a linear combination of any other. Otherwise det Matrix Algebra
A=0
SOL 1.8 Correct option is (D).

Since, if A is a square matrix of rank n , then it cannot be a singular.
SOL 1.9 Correct answer is - 28 .

5 3 2
1 2 6 = 5(20 - 30) - 3(10 - 18) + 2(5 - 6)
3 5 10
=- 50 + 24 - 2 =- 28
SOL 1.10 Correct option

.in
is (A).
a
h
.coh g
b f =a
a f
f c
-h
h f
g c
+g
h b
g f
g
ia f c
= a ^bc - f 2h - h ^hc - fg h + g ^hf - gb h
od = abc = af 2 - h2 c + hfg + ghf - g2 b
.n = abc + 2fgh - af 2 - bg2 - ch2
SOL 1.11
ww
Correct answer is - 43 .
w Determinant = 67
13 14
24 26
- 19
39 14
81 26
+ 21
= 134 + 2280 - 2457 =- 43

39 13
81 24

By interchanging any row or column, the value of determinant will remain
same. For the given matrix, the first and third row are interchanged, thus
the value remains the same.
SOL 1.13 Correct answer is - 1.

R 0 1 0 2V
S W
S- 1 1 1 3 W
We have A =S
0 0 0 1W
S W
S 1 - 2 0 1W
Expanding cofactor of a34 T X
0 1 0
A = - 1 -1 1 1
1 -2 0
=- [0 - 1 (0 - 1) + 0] =- 1


Page 22 SOL 1.14 Correct answer is 5.
Chap 1 Consider the given matrix be
Matrix Algebra R V
S2 1 1 1W
S1 2 1 1W
Im + AB =S W
S1 1 2 1W
S1 1 1 2W
T X
where m = 4 so, we obtain
R V R V
S2 1 1 1W S1 0 0 0W
S1 2 1 1W S0 1 0 0W
AB =S W-S W
S1 1 2 1W S0 0 1 0W
S1 1 1 2W S0 0 0 1W
RT VX TR V X
S1 1 1 1W S1W
S1 1 1 1W S1W
=S W = S W 61 1 1 1@
S1 1 1 1W S1W
S1 1 1 1W S1W
TR V X T X
S1W
S1W
= S W, B = 61 1 1 1@
i. n
Hence, we get A
S1W
S1W
Therefore, BA = 81 1
T RX V
S1W
.c
S1W o
1 1BS W = 64@
i a S1W
S1W
From the given property,
o d T X
Det Îm + AB h = Det În + BAh
. n
R V
S2 1 1 1W
S1 2 1 1W
w w Det S W = Det "61@ + 64@,

S1 1 2 1W
S1 1 1 2W
w
NOTE :
T X
= Det 65@ = 5
Determinant of identity matrix is always 1.

A = conjugate of A
3 1 + 2i
=> H
1 + 2i 2
and A* = Â hT = transpose of A
3 1 + 2i
=> H
1 - 2i 2
Since, A* = A
Hence, A is hermitian matrix.

For singularity of matrix,


8 l 0 Page 23
4 0 2 =0 Chap 1
12 6 0 Matrix Algebra
8 ^0 - 12h - l ^0 - 2 # 12h = 0 & l = 4
SOL 1.17 Correct answer is - 2 .

Matrix A is singular if A = 0
R V
S 0 1 - 2W
S- 1 0 3 W = 0
SS 2 - 2 l WW
1 -2 1 -T2 0 3X
or - (- 1) +2 +0 =0
-2 l 0 3 -2 l
or (l - 4) + 2 (3) = 0
or l =- 2
SOL 1.18
.in
Correct option is (C).
Given
.co EF = G
Rcos q - sin q 0V
S W
R1 0 0V
S
where G = I = Identity matrix
W
ia
S sin q
SS 0
cos q 0W # F = S0 1 0W
0 1WW SS0 0 1WW
od
T X T X
We know that the multiplication of a matrix and its inverse be a identity
matrix
.n AA-1 = I
ww
So, we can say that F is the inverse matrix of E
F = E -1 =
6adj.E @
E
w Rcos q - (sin q) 0VT

S
adj E = S sin q
SS 0
W
R cos q sin q 0V
S
cos q 0W = S- sin q cos q 0W
0 1WW SS 0 0 1WW
W
T X T X
E = 6cos q # (cos q - 0)@ - 8^- sin qh # ^sin q - 0hB + 0
= cos2 q + sin2 q = 1
R cos q sin q 0VW
6adj. E @ S
Hence, F = = S- sin q cos q 0W
E SS 0 0 1WW
T X

1 2 3 4
A ==
- 2 0 5 7G
We have
It is a 2 # 4 matrix, thus r (A) # 2
The second order minor
1 2
=4!0
-2 0
Hence, r (A) = 2


Page 24 SOL 1.20 Correct answer is 2.
Chap 1 We have
Matrix Algebra R V R V
S1 1 1 W S1 1 1 W
A = S1 - 1 0 W + S1 - 1 0 W R3 - R1
SS1 1 1 WW SS0 0 0 WW
T r (A) X< 3T
Since one full row is zero, X
1 1
Now =- 2 ! 0 , thus r (A) = 2
1 -1

R V
S1 2 3W
Here, A = S1 4 2W
SS2 6 5WW
R V
T X S1 2 3W
Performing operation R 31 ^- 1h, we get A + S1 4 2W
SS1 4 2WW
R VT X
S1 2 3W
By operation R 32 ^- 1h, we get A + S1 4 2W
SS0 0 0WW
i. n
1 2
A =0
T
.c o X
and
1 4 Y
=0
i a
Rank Âh = 2
o d
SOL 1.22
. n
Correct option is (B).
w
Here,
w
A = 2 ^- 9 + 8h + 2 ^- 2 + 3h = 0
2 1
w
But
Hence,
=0
0 3 Y
Rank Âh = 2

Consider 3 # 3 minors, maximum possible rank is 3.
Now we can obtain
4 2 1 2 1 3 4 1 3 4 2 3
6 3 4 = 0 , 3 4 7 = 0 , 6 4 7 = 0 and 6 3 7 = 0
2 1 0 1 0 1 2 0 1 2 1 1
Since, all 3 # 3 minors are zero. Now, we consider 2 # 2 minors
4 2 2 1
= 0, = 8-3 = 5 = Y 0
6 3 3 4
Hence, rank = 2

Since r (A) = 2 < order of matrix


2 -1 3 Page 25
Thus A = 4 7 l =0 Chap 1
1 4 5 Matrix Algebra
or (235 - 4l) + 1 (20 - l) + 3 (16 - 7) = 0
or 70 - 8l + 20 - l + 27 = 0 = 0
or, l = 13

It is 4 # 4 matrix, So its rank r (A) # 4
1 2 3 0
2 4 3 2
We have A =
3 2 1 3
6 8 7 5
1 2 3 0
2 4 3 2
= applying R4 - (R1 + R2 + R3) " R4
3 2 1 3
.in 0 0 0 0
.co =
1 2 3
0 0 -3
0 -4 -8
0
2
3
applying
R2 - 2R1 " R2
R3 - 3R1 " R3
ia 0 0 0 0
od
The only fourth order minor is zero.
1 2 3
.n
Since the third order minor 0 - 4 - 8 = (1)( - 4)( - 3) = 12 ! 0
0 0 -3
w
Therefore its rank is r (A) = 3
w
SOL 1.26 w
Here, A = 0
All minors of order 3 are zero, since two rows are identical.
1 0
The second minor =0
0 1 Y
Hence, Rank Âh = 2

Given the two matrices,
p q
A =>
r sH
p2 + q2 pr + qs
and B => H
pr + qs r2 + s2
To determine the rank of matrix A, we obtain its equivalent matrix using
the operation, a2i ! a2i - a21 a1i as
a11


Page 26 p q
Chap 1 A = >0 s - r q H
Matrix Algebra p
If s- r q = 0
p
or ps - rq = 0
then rank of matrix A is 1, otherwise the rank is 2.
Now, we have the matrix
p2 + q2 pr + qs
B => H
pr + qs r2 + s1
To determine the rank of matrix B , we obtain its equivalent matrix using
the operation, a2i ! a2i - a21 a1i as
a11
R 2 2 V
Sp + q pr + qs W
B = S ^ pr + qs h2
W
S 0 ^r2 + s2h - 2 2 W
S p +q W
T X
^pr + qs h2
If ^r + s h - 2
2 2
= ^ps - rq h = 0
2
i. n
p + q2
or ps - rq = 0
.c o
then rank of matrix B is 1, otherwise the rank is 2.
Thus, from the above results, we conclude that
i a
If ps - rq = 0 , then rank of matrix A and B is 1.
If ps - rq ! 0 , then rank of A and B is 2.
B also N .
o d
i.e. the rank of two matrices is always same. If rank of A is N then rank of
. n
SOL 1.28
w w
It is given that x, y, z are in A.P. with common difference d
w
Let
x = x , y = x + d , z = x + 2d
4 5 x 4 5
A = 5 6 y = 5 6 x+d = 1 1 d
x 4 5 x
6 k z 6 k x + 2d 1 k-6 d
Applying R2 - R1 = R2 and R 3 - R2 = R 3
4 5 x
= 1 1 d R3 = R3 - R2
0 k-7 0
A = 0 & ^k - 7h^4d - x h = 0
d = x , k = 7.
4

Ra V
S 1W
Let A = Sb1W, B = 6a2 b2 c2@
SSc WW
1
T X
Let C = AB


Ra V Ra a a b a c V
S 1W S1 2 1 2 1 2W Page 27
= Sb1W # 8a2 b2 c2B = Sb1 a2 b1 b2 b1 c2W Chap 1
SSc WW SSc a c b c c WW Matrix Algebra
1 1 2 1 2 1 2
The 3 # 3 minor of this matrix T Xis zero and all Tthe 2 # 2 minorsX are also
zero. So the rank of this matrix is 1, i.e.
r 6C @ = 1

Since all point are collinear,
x1 y1 1
Thus x2 y2 1 = 0
x3 y3 1
Therefore r (A) < 3
SOL 1.31
Let
.in
n =3
Then
.co R
S1 2 3 W
A = S2 4 6 W
V
ia SS3 6 9 WW
T
1 2 3
X
1 2 3
and
od A = 2 4 6 = 0 0 0
3 6 9 0 0 0
applying
R3 - 3R1 " R3
R2 - 2R1 " R2
.n
Thus rank if n = 3 then r (A) = 1 so possible answer is (B).
SOL 1.32
ww
w
If P is a matrix of order m # n and r (P) = n then n # m
In the normal form of P only n rows are non-zero
Now Q is a matrix of order n # p and r (PQ) = p then p # n but p ! n but
p ! n so p < n .
In the normal form of Q only p rows are non-zero.
Thus is the normal form of PQ only p rows are non zero.
r (PQ) = p

x = 8x1 x2 g xnBT
V = xxT
R V R V
Sx1W Sx1W
Sx2W Sx2W
=S W S W
ShW ShW
SxnW SxnW
T X T X
So rank of V is n .


Page 28 SOL 1.34 Correct option is (A).
Chap 1 Given that x, y, z are in A.P. with common differences d .
Matrix Algebra
Thus y = x + d,
z = x + 2d
4 5 x 4 5 x 4 5 x
Now A = 1 1 d = 5 6 x+d = 1 1 d
1 k-6 d 6 k x + 2d 1 k-6 d
Apply R2 - R1 = R2 and R 3 - R2 = R 3
4 5 x
= 1 1 d applying R3 - R2 " R3
0 k-7 0
Thus A = (k - 7)( 4d - x)
Since r (A) = 2 < order of matrix, Thus A = 0 or we get
(k - 7)( 4d - x) = 0
or d = x ,k = 7
4
i. n
.c o
Rank of a matrix is no. of linearly independent rows and columns of the
matrix.
Here Rank r (Q) = 4
i a
d
So Q will have 4 linearly independent rows and flour independent columns.
o
SOL 1.36
. n
Correct option is (D).
w
We have
w
A ==
1 -4
0 2G
C11 = 2, C12 = 0, C21 =- (- 4) = 4 , and C22 = 1
w C ==
2 0
4 1G
adj A = C T
2 4
==
0 1G

x y
A=
z b
b -y
adj A = =
-z x G
x y
adj(adj A) = =
z bG

Since, A(adjA) = A In


R V R V
S1 0 0 W S2 0 0 W Page 29
We have A(adjA) = 2 S0 1 0 W = S0 2 0 W Chap 1
SS0 0 1 WW SS0 0 2 WW Matrix Algebra
T X T X

We know that
adj(adj(A) = A n - 2 A
Here n = 2 so we get
adj(adjA) = A 2 - 2 A
= A 0 A = IA = A

We know that
adj(adj A) = A n - 2 A
.in
Putting n = 3 and A = 3 . so we get
adj(adj A) = A 3 - 2 A
.co = A A = 3A
ia
SOL 1.41
od
We have adj (adjA) = A (n - 1)
2
.n
Putting n = 3 and A = 3 we get
adj (adj A) = A 4 = 3 4 = 81
ww
SOL 1.42
w
Let B = adjA2 then B is also a 3 # 3 matrix.
adj (adjA2) = adj B = B 3 - 1 = B 2
2
= adjA2
= 8 A2 B = A2 4 = A 8 = 38
(3 - 1) 2

Since r (A) = n - 1, at least one (n - 1) rowed minor of A is non-zero, so at
least one minor and therefore the corresponding co-factor is non-zero.
So, adjA ! 0

If A = [aij ] n # n then detA = [Cij ]Tn # n where Cij is the cofactor of aij
Also Cij = (- 1) i + j Mij , where Mij is the minor of aij , obtained by leaving the
row and the column corresponding to aij and then taken the determinant of
the remaining matrix.
1 -2
Now, M11 = minor of a11 i.e. (- 1) =- 3
-2 1


Page 30 Similarly
Chap 1 2 -2 2 1
Matrix Algebra M12 = = 6; M13 = =- 6
2 1 2 -2
-2 -2 -1 -2
M21 = =- 6 ; M22 = 3;
-2 1 2 1 =
-1 -2 -2 -2
M23 = = 6; M31 = =6 ;
2 -2 1 -2
-1 -2 -1 -2
M32 = = 6; M33 = =3
2 -2 2 1
C11= (- 1) 1 + 1 M11 =- 3; C12 = (- 1) 1 + 2 M12 =- 6;

C13= (- 1) 1 + 3 M13 =- 6; C21 = (- 1) 2 + 1 M21 = 6;
C22= (- 1) 2 + 2 M22 = 3; C23 = (- 1) 2 + 3 M23 =- 6;
C31= (- 1) 3 + 1 M31 = 6; C32 = (- 1) 3 + 2 M32 =- 6;
C33= (- 1) 3 + 3 M33 = 3
R VT R- 1 - 2 - 2VT
S- 3 - 6 - 6 W S W
i. n
Thus adj A = S 6 3 - 6 W = 3 S 2 1 - 2W = 3AT
SS 6 - 6 3 WW SS 2 - 2 1WW
T X T X
.c o
i a
If A is zero, A-1 does not exist and the matrix A is said to be singular.
o d
Except (B) all satisfy this condition.
5 2
. n A =
2 1
= (5)( 1) - (2)( 2) = 1
w w
SOL 1.46
w
Correct option is (A).
We know A-1 = 1 adjA
A
-1 2
A ==
3 - 5G
Here =- 1
-5 -2
adj A = =
- 3 - 1G
Also,
A-1 = 1 =- 5 - 2G = =5 2G
-1 -3 -1 3 1

We know A-1 = 1 adj A
A
1 2
Here A = =- 3
5 7
7 -2
adj A = =
- 5 1G
Also,

A-1 = 1 = 7 - 2G = 1 =- 7 2 G Page 31
-3 -5 1 3 5 -1 Chap 1
Matrix Algebra

3 4
Let B-1 = = G = A and B = A-1
5 6
A
3 4
Here A = =- 2
5 6
6 -4
Also, adj A =
-5 3
6 -4
A-1 = 1= G
-2 -5 3
-3 2
== 5 -3G
in
2 2
o.
c
SOL 1.49
i .
For orthogonal matrix det M = 1 and M-1 = MT ,
a MT = =
A C
B 0G
od = M-1 = 1 > 0 - BH
.n
This implies B = -C
- BC - C A
or
ww - BC
B = 1 or B = ! 1
B
SOL 1.50
w
Inverse matrix is defined for square matrix only.

A
1 0 0
A = 5 2 0 = 4 ! 0,
3 1 2
4 10 - 10 T RS 4 0 0VW
adj A = 0 2 - 1 = S 10 2 0W
0 0 2 SS- 1 - 1 2WW
R 4 T X
S 0 0VW
A-1 = 1 S 10 2 0W
4S
S - 1 - 1 2WW
T X


Page 32 SOL 1.52 Correct answer is 0.01786.
Chap 1 1 = 1
det (2A) -1 =
Matrix Algebra 2A 2n A
Since A is a 3 # 3 matrix, therefore n = 3 and we have A = 7 .
det (2A) -1 = 3 1 = 1 = 1
2 A 8 # 7 56

C11 = 2 - (- 3) = 5
C21 =- [0 - (- 3)] =- 3
C31 = [- (- 1)] = 1
R = (1) C11 + 2C21 + 2C31 = 5 - 6 + 2 = 1
Let (7B) -1 = A = >

-1 2
4 - 7H
i. n
and 7B = A-1

A
.c o
Here A =
-1 2
i a
4 -7
=- 1
Also,
o
adj A = = d
-7 -2
- 4 - 1G
. n A-1 = 1 =- 7 - 2G
w
or
w -1 -4 -1
7 2
7B = A-1 = > H
4 1
w
or B = >4
1
7
2
7
1
7
H
SOL 1.55 Correct answer is 0.5.

R V
S0 1
0W 0
S0 1W
2 0
We have A =S
S0 0WW
3 2
S1 4
0W 1
T X
0 0 1
A =- 0 2 0 =- 1 (0 - 2) = 2
1 1 0
Now det (A-1) = 1 =1
det A 2

For orthogonal matrix we know that


AAT = I Page 33
and [AAT ] -1 = I-1 = I Chap 1
Matrix Algebra

From orthogonal matrix
[AAT ] = I
Since the inverse of I is I , thus
[AAT ] -1 = I-1 = I

Al = (AT A) -1 AT
= A-1 (AT ) -1 AT = A-1 I
Put Al = A-1 I in all option.
in
option (A) AAlA =A
o. AA-1 A
A
=A
=A (true)
option (B)
a.c (AAl) 2 =I
di (AA-1 I) 2
Î h2
=I
=I (true)
option (C)
no AlA
-1
A IA
=I
=I
w.
option (D) AAlA
I =I
= Al
(true)
ww AA-1 IA =A=
Y Al (false)

3 4
M => H
5 5
Given : 3
x 5
And [M]T = [M] -1
We know that when 6A@ = 6A@ then it is called orthogonal matrix.

T -1
6M @T = I
6M @
6M @T 6M @ = I
Substitute the values of M and M T , we get
3 3 4
1 0
> 45 3 H.>
x
H = >0 1H
5 5
3
5 5 x 5
R 3 4 + 3 x VW
S b # 3 l + x2 3
b5
S 5 5 # 5l 5 W 1 0
S 4 # 3 + 3x 4 4 3 3 W = >0 1H
Sb 5 5l 5 b 5 # 5 l + b 5 # 5 lW
T X


Page 34 9
+ x2 12
+ 53 x 1 0
>12 + 3 x H =>
0 1H
25 25
Chap 1 1
25 5
Matrix Algebra
Comparing both sides a12 element,
12 + 3 x = 0 " x =- 12 5 =- 4
25 5 25 # 3 5

2x 0 1 0 1 0
> x x H>- 1 2H = =0 1G
2x 0 1 0
or = 0 2x G = =0 1G
So, 2x = 1 & x = 1
2

2 -1 2 (2) (2) + (- 1) (1) 3
>3 2H>1H = > (3) (2) + (2) (1) H = =8 G
i. n
R1 3V
.c o
AAT = >
1 2
3 -1 4 S
0
H
S
i a W
S2 - 1W
=> o d
S0 4WW
T X
(1) (1) + (2) (2) + (0) (0) (1) (3) + (2) (- 1) + (0) (4)
(3) (1) + (- 1) (2) + 4 (0) (3) (3) + (- 1) (- 1) + (4) (4)H
. n
w w =>
5 1
1 26H
SOL 1.63 w
- 1 7 - 2 1 -1
A =>
- 1 20H> 3 5H
-1 7 1 > 5 - 1H
=> H
- 1 20 - 13 l - 3 - 2
b
= 1 >1 7 H> 5 - 1H
- 13 1 20 - 3 - 2
= 1 >26 - 13H
- 13 65 - 39
2 1
== G
5 3

2 - 0.1 1
2 a
We have A ==
0 3 G and A-1
= >0 bH
Now AA-1 = I


2 - 0.1 12 a 1 0 Page 35
or >0 3 H> H = >0 1H
0 b Chap 1
Matrix Algebra
1 2a - 0.1b 1 0
or >0 3b H => H
0 1
or 2a - 0.1 = 0 and 3b = 1
Thus solving above we have b = 1 and a = 1
3 60
Therefore a+b = 1+ 1 = 7
3 60 20

We know that AA-1 = I
2 - 0.1 12 a 1 2a - 0.1b 1 0
or >0 H>
3 0 b H =>
0 3b H => H
0 1
We get 3b = 1 or b = 1
3
and
.in
2a - 0.1b = 0 or a = b
20
Thus
. o
a+b = 1+1 1 = 7
c 3 3 20 20
ia
SOL 1.66
od
2 6 3 x
We have
.n A ==
3 9 G and B = > H, AB = 0
y 2
We get
ww 2 6 3 x
6 + 6y 2x + 12
=9 + 9y 3x + 18G = =0
0
=3 9G=y 2 G = =0
0
0
0G
0
0G
or
We get
and
w 6 + 6y = 0 or y =- 1
2x + 12 = 0 or x =- 6

R V
1
1 1 0S W
AB = =
1 0 1GS W
S0 W
S1 W
T X(1)( 0) + (0)( 1)
(1)( 1) + 1
== G =
(1)( 1) + (0)( 0) + (1)( 1) = 2G

R V
1 2W
1 1 2S 1 4
AB = = GS 2 0W = =
4 4G
We have
2 1 0S W
S- 1 1 W
1 4 T X
(AB) = =
4 4G
T


Page 36 SOL 1.69 Correct option is (C).
Chap 1 R V
S 2 - 1W 1 - 2 - 5
AB = S 1 0 W= G
Matrix Algebra
SS- 3 4 WW 3 4 0
TR X V
S(2)( 1) + (- 1)( 3) (2)( - 2) + (- 1)( 4) (2)( - 5) + (- 1)( 0)W
= S (1)( 1) + (0)( 3) (1)( - 2) + (0)( 4) (1)( - 5) + (0)( 0) W
SS(- 3)( 1) + (4)( 3) (- 3)( - 2) + (4)( 4) (- 3)( - 5) + (4)( 0)WW
RT V X
S- 1 - 8 - 10 W
= S 1 -2 -5 W
SS 9 22 15 WW
T X

R V
S0 1 0 0W
S0 0 1 0W
We have X =S W
S0 0 0 1W
S0 0 0 0W
i. n
TR XV
S0 0 0 0 W
S1 0 0 0W
and transpose of X , XT = S
S0 1 0 0W
S0 0 1 0W
W
.c o
rank of XT X .
i a
Here, we can see that rank ofT matrix Xx = 3 , hence, we can determine the
have
o d
Let Y = X $ XT , the rank of Y # rank of X . Also, X-1 Y = XT and so we
. nRank X = Rank XT # Rank of Y
w w
Hence, from Eqs. (1) and (2), we get
Rank of X = Rank of Y
Hence, rank of X $ XT is 3
SOL 1.71
w
X 4 # 3 " X cT# 4
X T3 # 4 Y4 # 3 " (XT Y) 3 # 3
(XY Y) 3 # 3 " (XT Y) -13 # 3
P2 # 3 " P 3T# 2
(XT Y) -3 # 3 P 3 # 2 " "(X Y) PT ,3 2
1 T T -1
P2 # 3 {(XT ) Y-1 PT } 3 # 2 " 6P (X Y) P @2 # 2

#
T -1 T
[P (XT Y) -1 PT ]T2 # 2 " [P (XT Y) -1 PT ] 2 # 2

cos a sin a cos b sin b
A a .A b = >
- sin a cos aH>- sin b cos bH
cos (a + b) sin (a + b)
=>
- sin (a + b) cos (a + b)H
= Aa + b


Also, it is easy to prove by induction that Page 37
cos na sin na Chap 1
(A a) n = =
- sin na cos na G Matrix Algebra

Let tan a = t
2
1 - tan2 a2 2
Then, cos a = 2 a
= 1 - t2
1 + tan 2 t+t
2 tan a2
and sin a = 2 a
= 2t 2
1 + tan 2 1+t
cos a - sin a 1 tan a2 cos a - sin a
=> H = sin a cos a G
(I - A) > H a #
sin a cos a - tan 2 1
R 2 V
S 1 - t2 - 2t W
1 t S 1 + t (1 + t2) W
==
- t 1G # S 2t
.in S
1 - t2 W
S(1 + t ) 1 + t2 W
2 W
.co =>
1 -t
=
T
t 1 H >tan a2
1 - tan a2
1 H
X
= (I + A)
ia
SOL 1.74
od
.n AAT = >
cos q sin q cos q - sin q
H>
- sin q cos q sin q cos q
H
ww =>
cos2 q + sin2 q
- sin q cos q + cos q sin q
- cos q sin q + sin q cos q
sin2 q + cos2 q
H
w 1 0
=> H
0 1
= 1, Hence A is orthogonal matrix.

cos q cos f cos (q - f) cos a sin f cos (q - f)
AB = =
cos f sin a cos (a - f) sin q sin f cos (q - f) G
Is a null matrix when cos (q - f) = 0 , this happens when (q - f) is an odd
multiple of p .
2

a b
Let matrix A be =
c dG
1 1 a b 1 a-b 1
From A > H =-> H we get = G= G == G =-= G
-1 -1 c d -1 c-d -1
We have a - b =- 1 ...(1)
and c-d = 1 ...(2)


Page 38 1 1
From A > H =- 2 > H we get
Chap 1 -2 -2
Matrix Algebra
a b 1 a - 2b 1
=c d G=- 2G = =c - 2d G =- 2 =- 2G
we have a - 2b =- 2 ...(2)
c - 2d =4 ...(4)
Solving equation (1) and (3) a = 0 and b = 1
Solving equation (2) and (4) c =- 2 and d =- 3
0 1
A ==
- 2 - 3G
Thus
If we check all option then result of option C after multiplication gives result.

3 -4 3 -4 5 -8
A2 = =
1 - 1G=1 - 1G =2 - 3G
=
If we put n = 2 in option, then only D satisfy.

i. n
.c o
R V
a
S3 W
i
R V
S1 W
R V
S2 W
R V
S- 1W
Sb W = k1 S3 W + k2 S6 W + k3 S- 3 W
R V
o R V dSSc WW
TR VX R TV X
SS2 WW SS4 WW
T X
SS- 2 WW
T X
.
S1 W
n S1 W S1 W S3 W
k1 S3 W + 2k2 S3 W - k3 S3 W = Sb W
SS2 WW SS2 WW SS2 WW SSc WW
w w T X T X RT VX RT VX
S1 W S3 W
(k1 + 2k2 - k3) S3 W = Sb W
w SS2 WW SSc WW
k1 + 2k2 -Tk3X = T3 X
3k1 + 6k2 - 3k3 = b
2k1 + 6k2 - 2k3 = c
& b = 9,
c =6

det (A) = (ah - cf) k + bef + cdg - aeg - bdh
Thus matrix A is invertible for all k if (and only if) the coefficient (ah - cf)
of k is 0, while the sum bef + cdg - aeg - bdh is non zero.
& Thus infinitely many other sol n
***********


Engineering-Mathematics Wew-Kanodia PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Engineering-Mathematics Wew-Kanodia PDF

Uploaded by

Copyright:

Available Formats

Eighth Edition

NODIA & COMPANY

Copyright By NODIA & COMPANY

NODIA & COMPANY

Printed by Nodia and Company, Jaipur

We wish you good luck !

Engineering Mathematics (EC, EE, and IN Branch )

Transform Theory: Fourier transform, Laplace transform, Z-transform.

Engineering Mathematics (ME, CE and PI Branch )

CHAPTER 1 MATRIX ALGEBRA

1.2 MULTIPLICATION OF MATRICES 1

1.3 TRANSPOSE OF A MATRIX 2

1.4 DETERMINANT OF A MATRIX 2

1.5 RANK OF MATRIX 2

1.6 ADJOINT OF A MATRIX 3

1.7 INVERSE OF A MATRIX 3

1.9 NORMAL FORM 5

CHAPTER 2 SYSTEMS OF LINEAR EQUATIONS

2.4 SOLUTION OF A SYSTEM OF LINEAR EQUATIONS 40

CHAPTER 3 EIGENVALUES AND EIGENVECTORS

3.2 EIGENVALUES AND EIGEN VECTOR 65

3.3 DETERMINATION OF EIGENVALUES AND EIGENVECTORS 66

3.4 CAYLEY-HAMILTON THEOREM 66

3.6 SIMILARITY OF MATRICES 68

CHAPTER 4 LIMIT, CONTINUITY AND DIFFERENTIABILITY

4.2 LIMIT OF A FUNCTION 99

CHAPTER 5 MAXIMA AND MINIMA

5.2 MONOTONOCITY 139

5.3 MAXIMA AND MINIMA 139

CHAPTER 6 MEAN VALUE THEOREM

6.2 ROLLES THEOREM 163

6.3 LAGRANGES MEAN VALUE THEOREM 163

6.4 CAUCHYS MEAN VALUES THEOREM 163

CHAPTER 7 PARTIAL DERIVATIVES

7.2 PARTIAL DERIVATIVES 175

7.4 CHANGE OF VARIABLES 176

7.6 EULERS THEOREM 176

CHAPTER 8 DEFINITE INTEGRAL

8.2 DEFINITE INTEGRAL 191

8.3 IMPORTANT FORMULA FOR DEFINITE INTEGRAL 192

8.4 DOUBLE INTEGRAL 192

CHAPTER 9 DIRECTIONAL DERIVATIVES

9.2 DIFFERENTIAL ELEMENTS IN COORDINATE SYSTEMS 223

9.3 DIFFERENTIAL CALCULUS 223

9.4 GRADIENT OF A SCALAR 224

9.5 DIVERGENCE OF A VECTOR 224

9.6 CURL OF A VECTOR 225

9.7 CHARACTERIZATION OF A VECTOR FIELD 225

9.8 LAPLACIAN OPERATOR 225

9.9 INTEGRAL THEOREMS 226

CHAPTER 10 FIRST ORDER DIFFERENTIAL EQUATIONS

10.2 DIFFERENTIAL EQUATION 247

10.4 SOLUTION OF A DIFFERENTIAL EQUATION 249

10.5 VARIABLES SEPARABLE FORM 249

10.9 EXACT DIFFERENTIAL EQUATION 254

CHAPTER 11 HIGHER ORDER DIFFERENTIAL EQUATIONS

11.2 LINEAR DIFFERENTIAL EQUATION 283

11.4 PARTICULAR INTEGRAL 285

11.6 EULER EQUATION 288

CHAPTER 12 INITIAL AND BOUNDARY VALUE PROBLEMS

12.2 INITIAL VALUE PROBLEMS 317

12.3 BOUNDARY-VALUE PROBLEM 317

CHAPTER 13 PARTIAL DIFFERENTIAL EQUATION